perm filename W85.IN[LET,JMC] blob
sn#789532 filedate 1985-03-31 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00741 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00078 00002 ∂01-Jan-85 1629 ELLIOTT%SLACVM.BITNET@Berkeley BITNET mail follows
C00081 00003 ∂02-Jan-85 0813 BSCOTT@SU-SCORE.ARPA
C00082 00004 ∂02-Jan-85 0814 BSCOTT@SU-SCORE.ARPA Re: complaint about heat withdrawn in confusion
C00083 00005 ∂02-Jan-85 0939 KUO THE PROLOG DIGEST
C00084 00006 ∂02-Jan-85 1000 JMC*
C00085 00007 ∂02-Jan-85 1302 RA
C00086 00008 ∂02-Jan-85 1542 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C00087 00009 ∂02-Jan-85 1550 RA industrial lectureships
C00088 00010 ∂02-Jan-85 1608 CLT info on Elxsi via fateman
C00091 00011 ∂03-Jan-85 0001 @SU-CSLI.ARPA:YM@SU-AI.ARPA Talk on Rewrite rules at IBM San Jose.
C00094 00012 ∂03-Jan-85 0913 SMC using terminal at the house
C00095 00013 ∂03-Jan-85 1234 RA
C00096 00014 ∂03-Jan-85 1321 RA
C00097 00015 ∂03-Jan-85 1427 COTTLE@SU-SIERRA.ARPA Re: error in Karmarkar abstract
C00098 00016 ∂03-Jan-85 1432 COTTLE@SU-SIERRA.ARPA Re: error in Karmarkar abstract
C00102 00017 ∂03-Jan-85 1725 ME Prancing Pony Bill
C00104 00018 ∂03-Jan-85 1824 CS.RICH@UTEXAS-20.ARPA Re: fantasy in HCN
C00106 00019 ∂03-Jan-85 2123 GLB
C00107 00020 ∂03-Jan-85 2125 SMC TeX
C00108 00021 ∂03-Jan-85 2333 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Special meeting of the Seminar in Logic and Foundations of Mathematics
C00110 00022 ∂04-Jan-85 0059 SMC TeX
C00111 00023 ∂04-Jan-85 0212 SMC TeX
C00112 00024 ∂04-Jan-85 0229 SMC
C00113 00025 ∂04-Jan-85 0825 SHARON@SU-SCORE.ARPA Gianluigi Bellin
C00115 00026 ∂04-Jan-85 0910 FEIGENBAUM@SUMEX-AIM.ARPA beginning closer working relationships
C00117 00027 ∂04-Jan-85 0924 ELLIOTT%SLACVM.BITNET@Berkeley BITNET mail follows
C00119 00028 ∂04-Jan-85 0936 SHARON@SU-SCORE.ARPA
C00120 00029 ∂04-Jan-85 1008 OLENDER@SU-SCORE.ARPA GENERAL FACULTY MEETING 1/8/85
C00122 00030 ∂04-Jan-85 1052 CLT meeting on parallel lisps
C00124 00031 ∂04-Jan-85 1119 RA
C00125 00032 ∂04-Jan-85 1249 RA
C00126 00033 ∂04-Jan-85 1414 RA
C00127 00034 ∂04-Jan-85 1439 EENGELMORE@SUMEX-AIM.ARPA MCC Industrial Affiliates Program
C00129 00035 ∂04-Jan-85 1517 ARIADNE@SU-SCORE.ARPA CSD colloquium
C00134 00036 ∂04-Jan-85 1654 NILSSON@SU-SCORE.ARPA Re: MCC Industrial Affiliates Program
C00136 00037 ∂04-Jan-85 1708 RPG
C00138 00038 ∂04-Jan-85 1725 EENGELMORE@SUMEX-AIM.ARPA Erratum
C00139 00039 ∂04-Jan-85 1755 FEIGENBAUM@SUMEX-AIM.ARPA Re: MCC Industrial Affiliates Program
C00141 00040 ∂05-Jan-85 1255 CLT arpa paragraph(s)
C00142 00041 ∂05-Jan-85 1552 RINDFLEISCH@SUMEX-AIM.ARPA Re: MCC Industrial Affiliates Program
C00147 00042 ∂05-Jan-85 1827 NILSSON@SU-SCORE.ARPA Re: radical computing
C00148 00043 ∂05-Jan-85 2322 SMC TeX
C00151 00044 ∂06-Jan-85 0426 GROSOF@SU-SCORE.ARPA GOETZ AND PERSONALLY DEALING WITH REAL VIOLENCE- A NY'er's CREED
C00172 00045 ∂06-Jan-85 1431 VAL Extended abstract of my two papers on circumscription
C00178 00046 ∂07-Jan-85 0911 SHORTLIFFE@SUMEX-AIM.ARPA MCC University Affiliates Program
C00181 00047 ∂07-Jan-85 1016 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
C00183 00048 ∂07-Jan-85 1104 RPG Sequent
C00184 00049 ∂07-Jan-85 1143 AAAI@SRI-AI.ARPA Rebate policy
C00186 00050 ∂07-Jan-85 1200 JMC*
C00187 00051 ∂07-Jan-85 1216 GREEP@SU-CSLI.ARPA Michael Kohlhaas
C00188 00052 ∂07-Jan-85 1311 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Course announcement update
C00193 00053 ∂07-Jan-85 1353 MOGUL@SU-SCORE.ARPA Re: Michael Kohlhaas
C00195 00054 ∂07-Jan-85 1358 GLB
C00196 00055 ∂07-Jan-85 1716 OLENDER@SU-SCORE.ARPA FACULTY LUNCH
C00197 00056 ∂07-Jan-85 1825 AAAI-OFFICE@SUMEX-AIM.ARPA Conference and Workshop policies and procedures
C00200 00057 ∂07-Jan-85 1835 NILSSON@SU-SCORE.ARPA CS 224
C00202 00058 ∂07-Jan-85 2049 BUCHANAN@SUMEX-AIM.ARPA Re: CS 224
C00204 00059 ∂08-Jan-85 0914 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
C00207 00060 ∂08-Jan-85 0958 RA
C00208 00061 ∂08-Jan-85 1022 GREEP@SU-CSLI.ARPA Re: Michael Kohlhaas
C00209 00062 ∂08-Jan-85 1026 RA
C00210 00063 ∂08-Jan-85 1058 TAJNAI@SU-SCORE.ARPA Arno Penzias
C00212 00064 ∂08-Jan-85 1136 TW 224
C00213 00065 ∂08-Jan-85 1634 SMC scribe
C00214 00066 ∂08-Jan-85 1643 OLENDER@SU-SCORE.ARPA FULL FAULTY MEETING TODAY
C00215 00067 ∂08-Jan-85 1708 RPG Re: Tomorrow
C00217 00068 ∂08-Jan-85 2008 @SU-SCORE.ARPA:lantz@Pescadero Kodak visitors
C00219 00069 ∂08-Jan-85 2038 RESTIVO@SU-SCORE.ARPA Re: for inclusion in Prolog Digest
C00220 00070 ∂08-Jan-85 2233 @SU-SCORE.ARPA:baskett@decwrl.ARPA the Computer X undergraduate program at Stanford
C00224 00071 ∂08-Jan-85 2240 WIEDERHOLD@SU-SCORE.ARPA CS Colloquium - June 15, Prof. WIRTH on MODULA II compilers
C00227 00072 ∂08-Jan-85 2251 WIEDERHOLD@SU-SCORE.ARPA OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
C00230 00073 ∂08-Jan-85 2349 WIEDERHOLD@SUMEX-AIM.ARPA re: OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
C00232 00074 ∂09-Jan-85 0054 @SU-SCORE.ARPA:KARP@SUMEX-AIM.ARPA Special CSD TGIF
C00234 00075 ∂09-Jan-85 0921 LUNDSTROM@SU-SIERRA.ARPA MCC UNIVERSITY Affiliates Program
C00238 00076 ∂09-Jan-85 0932 RA
C00239 00077 ∂09-Jan-85 0936 CL.BOYER@UTEXAS-20.ARPA mentioning Church-Rosser
C00240 00078 ∂09-Jan-85 1442 @SU-SCORE.ARPA:FEIGENBAUM@SUMEX-AIM.ARPA Re: the Computer X undergraduate program at Stanford
C00243 00079 ∂09-Jan-85 1500 NILSSON@SU-SCORE.ARPA Lunch Topic
C00245 00080 ∂09-Jan-85 1516 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA meeting preemption
C00247 00081 ∂09-Jan-85 1550 RA
C00248 00082 ∂09-Jan-85 1554 GENESERETH@SUMEX-AIM.ARPA Steve Tappel
C00251 00083 ∂09-Jan-85 1610 BARWISE@SU-CSLI.ARPA New Director
C00254 00084 ∂09-Jan-85 2255 @SU-SCORE.ARPA:pratt@Navajo X
C00257 00085 ∂09-Jan-85 2255 @SU-SCORE.ARPA:cheriton@Pescadero Re: the Computer X undergraduate program at Stanford
C00260 00086 ∂09-Jan-85 2314 CLT
C00261 00087 ∂09-Jan-85 2325 @SU-SCORE.ARPA:reid@Glacier Re: the Computer X undergraduate program at Stanford
C00264 00088 ∂10-Jan-85 1000 JMC*
C00265 00089 ∂10-Jan-85 1001 RA message for McCarthy
C00266 00090 ∂10-Jan-85 1001 ALDERSON@SU-SCORE.ARPA mantraps
C00267 00091 ∂10-Jan-85 1014 @SU-SCORE.ARPA:lantz@Pescadero Visit by Peter Kirstein
C00269 00092 ∂10-Jan-85 1119 RA
C00270 00093 ∂10-Jan-85 1142 NILSSON@SU-SCORE.ARPA Lunch Topics
C00273 00094 ∂10-Jan-85 1300 JMC*
C00274 00095 ∂10-Jan-85 1446 RA
C00275 00096 ∂10-Jan-85 1517 RA
C00276 00097 ∂10-Jan-85 1634 ullman@diablo Supercomputing center
C00278 00098 ∂10-Jan-85 1746 @SU-SCORE.ARPA:HK.PLD@Forsythe MCC's University Affiliates Program
C00281 00099 ∂10-Jan-85 2218 ullman@diablo re: Supercomputing center
C00282 00100 ∂10-Jan-85 2240 ullman@diablo re: Supercomputing center
C00283 00101 ∂11-Jan-85 0822 djl%brandeis.csnet@csnet-relay.arpa Logics of knowledge
C00286 00102 ∂11-Jan-85 1022 KAELBLING@SRI-AI.ARPA Your book
C00288 00103 ∂11-Jan-85 1027 RA AAAS symposium
C00289 00104 ∂11-Jan-85 1109 RA
C00290 00105 ∂13-Jan-85 1022 BOSACK@SU-SCORE.ARPA Common-access terminals in the Math/CS Library
C00291 00106 ∂13-Jan-85 1052 FIKES@USC-ECL.ARPA AAAI Executive Council Minutes
C00300 00107 ∂13-Jan-85 1124 CLT see you wednesday
C00301 00108 ∂13-Jan-85 1231 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Re: Common-access terminals in the Math/CS Library
C00303 00109 ∂13-Jan-85 1442 NILSSON@SU-SCORE.ARPA Hewlett-Packard Machines
C00308 00110 ∂13-Jan-85 1515 RPG Sequent
C00310 00111 ∂13-Jan-85 1525 RPG My appointment
C00312 00112 ∂13-Jan-85 1559 NILSSON@SU-SCORE.ARPA
C00327 00113 ∂13-Jan-85 2053 RPG HP Machines
C00330 00114 ∂13-Jan-85 2226 cheriton@Pescadero Re: Sequent
C00332 00115 ∂14-Jan-85 0846 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
C00334 00116 ∂14-Jan-85 0859 NILSSON@SU-SCORE.ARPA Undergraduate Computer Education
C00351 00117 ∂14-Jan-85 0900 fateman%ucbdali@Berkeley small conference on symbolic high-speed computation
C00358 00118 ∂14-Jan-85 0908 @SU-SCORE.ARPA:SHORTLIFFE@SUMEX-AIM.ARPA Re: Hewlett-Packard Machines
C00362 00119 ∂14-Jan-85 0915 LIBRARY@SU-SCORE.ARPA SOCRATES--New Developments
C00365 00120 ∂14-Jan-85 0951 RA
C00366 00121 ∂14-Jan-85 1105 RPG Conference
C00367 00122 ∂14-Jan-85 1105 RPG
C00368 00123 ∂14-Jan-85 1304 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F1/F4 meetings
C00370 00124 ∂14-Jan-85 1808 BERG@SU-SCORE.ARPA Course listing
C00371 00125 ∂14-Jan-85 2000 JMC*
C00372 00126 ∂14-Jan-85 2025 DEK backtracking
C00375 00127 ∂14-Jan-85 2059 RPG Trip to Oregon
C00376 00128 ∂15-Jan-85 0738 AI.WOODY@MCC.ARPA Re: AAAI sponsorship and help with conference
C00377 00129 ∂15-Jan-85 0751 SELKER@SU-SCORE.ARPA me
C00379 00130 ∂15-Jan-85 0758 CL.BOYER@UTEXAS-20.ARPA more info
C00380 00131 ∂15-Jan-85 0840 TAJNAI@SU-SCORE.ARPA Idaho
C00381 00132 ∂15-Jan-85 0945 RA message for MCCarthy
C00383 00133 ∂15-Jan-85 0946 FISHER@SU-SCORE.ARPA Faculty Lunch
C00384 00134 ∂15-Jan-85 1155 RA
C00385 00135 ∂15-Jan-85 1238 RA
C00386 00136 ∂15-Jan-85 1305 CS.NOVAK@UTEXAS-20.ARPA AI Faculty
C00388 00137 ∂15-Jan-85 1344 RA
C00389 00138 ∂15-Jan-85 1358 RTC CS206
C00390 00139 ∂15-Jan-85 1418 CHEESEMAN@SRI-AI.ARPA Probability Workshop
C00396 00140 ∂15-Jan-85 1440 BSCOTT@SU-SCORE.ARPA MS-AI Vote
C00398 00141 ∂15-Jan-85 1537 RA
C00399 00142 ∂15-Jan-85 1537 RA Dave Fink
C00400 00143 ∂15-Jan-85 1543 CL.SHANKAR@UTEXAS-20.ARPA more info
C00427 00144 ∂15-Jan-85 1808 ANDY@SU-SCORE.ARPA [Jonathan A Rees <JAR @ MIT-MC>: [CENT: proposed destruction of data on tape]]
C00437 00145 ∂15-Jan-85 1918 cha@mitre-bedford Bibliography and writeup on nonmonotonic reasoning
C00439 00146 ∂16-Jan-85 0314 GROSOF@SU-SCORE.ARPA semantics and model theory for Default Logic- news
C00442 00147 ∂16-Jan-85 0718 perlis@tove Re: non-monotonic bibliography
C00445 00148 ∂16-Jan-85 0802 BARWISE@SU-CSLI.ARPA Jobs for Postdocs
C00447 00149 ∂16-Jan-85 0902 WIEDERHOLD@SU-SCORE.ARPA CS Colloquium #3, Jan. 22nd MCC and Lattices
C00451 00150 ∂16-Jan-85 1117 RA
C00452 00151 ∂16-Jan-85 1331 SG QLAMBDA or parallel processing
C00453 00152 ∂16-Jan-85 1348 RA
C00454 00153 ∂16-Jan-85 1410 RA
C00455 00154 ∂16-Jan-85 1545 SSO.OWICKI@SU-SIERRA.ARPA [Olaf I. Henjum <O.OLAF@LOTS-C>: BTL interest in QLambda]
C00459 00155 ∂16-Jan-85 1614 RA
C00460 00156 ∂16-Jan-85 1614 REGES@SU-SCORE.ARPA Faculty Senate
C00464 00157 ∂16-Jan-85 1652 RA Carolyn
C00465 00158 ∂16-Jan-85 2124 CL.SHANKAR@UTEXAS-20.ARPA Corrections in the annotation
C00467 00159 ∂17-Jan-85 0129 DAVIES@SUMEX-AIM.ARPA HPP Architecture Meeting, Wed. 1/23., 9 am
C00468 00160 ∂17-Jan-85 0236 ARK@SU-SCORE.ARPA Joe Halpern
C00470 00161 ∂17-Jan-85 0851 LEIB@SU-SCORE.ARPA Agree
C00471 00162 ∂17-Jan-85 1011 FIKES@USC-ECL.ARPA re: AAAI Executive Council Minutes
C00473 00163 ∂17-Jan-85 1012 @MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet new generation systems?
C00477 00164 ∂17-Jan-85 1137 RA
C00478 00165 ∂17-Jan-85 1137 RA Dave Fink
C00479 00166 ∂17-Jan-85 1404 RA
C00480 00167 ∂17-Jan-85 1451 RA
C00481 00168 ∂17-Jan-85 1607 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C00483 00169 ∂17-Jan-85 1611 AAAI-OFFICE@SUMEX-AIM.ARPA Conversation with Jenks
C00485 00170 ∂17-Jan-85 1647 LB@SU-CSLI.ARPA February 7 Colloquium
C00487 00171 ∂17-Jan-85 1659 RESTIVO@SU-SCORE.ARPA Advice sought
C00491 00172 ∂17-Jan-85 1759 JJW Trip to Sequent
C00492 00173 ∂17-Jan-85 1843 EJS ok
C00493 00174 ∂17-Jan-85 1913 FIKES@USC-ECL.ARPA re: AAAI Executive Council Minutes
C00494 00175 ∂17-Jan-85 2123 RPG
C00503 00176 ∂17-Jan-85 2131 RPG
C00506 00177 ∂18-Jan-85 0705 @MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet re: new generation systems?
C00508 00178 ∂18-Jan-85 0904 OHLANDER@USC-ISI.ARPA re: Program Summary
C00509 00179 ∂18-Jan-85 1020 @SU-CSLI.ARPA:PCOHEN@SRI-AI.ARPA [Phil Cohen <PCOHEN@SRI-AI.ARPA>: Next Tues.]
C00511 00180 ∂18-Jan-85 1023 CLT rpg
C00512 00181 ∂18-Jan-85 1045 RA
C00513 00182 ∂18-Jan-85 1115 RA
C00514 00183 ∂18-Jan-85 1347 NILSSON@SU-SCORE.ARPA IBM Grant
C00517 00184 ∂18-Jan-85 1457 SJG discussion
C00518 00185 ∂18-Jan-85 1810 YOM
C00519 00186 ∂18-Jan-85 1833 YOM
C00520 00187 ∂18-Jan-85 2026 JJW DARPA
C00521 00188 ∂19-Jan-85 0900 JMC*
C00522 00189 ∂19-Jan-85 1512 YOM
C00523 00190 ∂19-Jan-85 1737 LLW@S1-A.ARPA Foot-Dragging
C00525 00191 ∂20-Jan-85 0000 JMC*
C00526 00192 ∂20-Jan-85 1253 RESTIVO@SU-SCORE.ARPA
C00527 00193 ∂20-Jan-85 1437 GOLUB@SU-SCORE.ARPA Forsythe Lectures
C00529 00194 ∂20-Jan-85 2033 DAVIES@SUMEX-AIM.ARPA HPP visit
C00530 00195 ∂21-Jan-85 1255 DAVIES@SUMEX-AIM.ARPA HPP Visit
C00532 00196 ∂21-Jan-85 1515 DAVIES@SUMEX-AIM.ARPA McCarthy visit -- Tuesday, January 22, 10 am
C00534 00197 ∂22-Jan-85 0900 JMC*
C00535 00198 ∂22-Jan-85 0921 NILSSON@SU-SCORE.ARPA Lunch
C00536 00199 ∂22-Jan-85 1050 komorowski.pa@Xerox.ARPA Visit
C00538 00200 ∂22-Jan-85 1152 SHAHN@SUMEX-AIM.ARPA Re: no mtg next Wed
C00542 00201 ∂22-Jan-85 1232 U-REDDY@UTAH-20.ARPA Integers puzzle
C00544 00202 ∂22-Jan-85 1237 RA
C00545 00203 ∂22-Jan-85 1323 RA
C00546 00204 ∂22-Jan-85 1510 RA
C00547 00205 ∂22-Jan-85 1607 RA
C00548 00206 ∂23-Jan-85 0900 TAJNAI@SU-SCORE.ARPA Pretend it's BBoard
C00549 00207 ∂23-Jan-85 0931 RESTIVO@SU-SCORE.ARPA
C00550 00208 ∂23-Jan-85 1552 CLT q
C00551 00209 ∂23-Jan-85 1657 @SU-SCORE.ARPA:pratt@Navajo Map to our house
C00554 00210 ∂23-Jan-85 1713 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00556 00211 ∂23-Jan-85 1713 ERIC@SU-CSLI.ARPA Talk
C00557 00212 ∂23-Jan-85 1715 WIEDERHOLD@SU-SCORE.ARPA CS colloquium Leiserson Parallel architecture Jan.29
C00562 00213 ∂23-Jan-85 1753 GLB
C00563 00214 ∂24-Jan-85 0124 LES QLISP proposal outline
C00571 00215 ∂24-Jan-85 0212 WIEDERHOLD@SUMEX-AIM.ARPA [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: Re: Talking to Klaus Wirth]
C00573 00216 ∂24-Jan-85 1334 RA
C00574 00217 ∂24-Jan-85 1345 cha@mitre-bedford Info on CSLI summer school
C00576 00218 ∂24-Jan-85 1407 FFL Consulting Disclosure Form
C00580 00219 ∂24-Jan-85 1409 RA
C00581 00220 ∂24-Jan-85 1536 WIEDERHOLD@SUMEX-AIM.ARPA
C00582 00221 ∂24-Jan-85 1539 INGRID@SU-CSLI.ARPA Info on CSLI Summer School
C00583 00222 ∂24-Jan-85 1600 fateman%ucbdali@Berkeley Re: Bob Kahn is here
C00584 00223 ∂24-Jan-85 1611 RA
C00585 00224 ∂24-Jan-85 1613 RA Bob Kahn
C00586 00225 ∂24-Jan-85 1626 RA Bob Kahn
C00588 00226 ∂24-Jan-85 1719 RA
C00589 00227 ∂24-Jan-85 1756 Hays@SRI-KL.ARPA thanks, lets do it again
C00590 00228 ∂24-Jan-85 1857 SG DM2500 works well
C00591 00229 ∂24-Jan-85 1951 RPG
C00592 00230 ∂24-Jan-85 2046 fateman%ucbdali@Berkeley Re: microadjustment
C00594 00231 ∂25-Jan-85 0538 OHLANDER@USC-ISI.ARPA
C00595 00232 ∂25-Jan-85 0805 CS.RICH@UTEXAS-20.ARPA re: fantasy in HCN
C00596 00233 ∂25-Jan-85 0900 CLT*
C00597 00234 ∂25-Jan-85 0932 TW
C00598 00235 ∂25-Jan-85 1000 NILSSON@SU-SCORE.ARPA Tuesday lunches
C00600 00236 ∂25-Jan-85 1116 RA Vienna trip
C00602 00237 ∂25-Jan-85 1348 RA
C00603 00238 ∂25-Jan-85 1440 RA
C00604 00239 ∂25-Jan-85 1518 HI.RICH@MCC.ARPA re: fantasy in HCN
C00605 00240 ∂25-Jan-85 1955 JJW@SU-AI.ARPA CSD facilities
C00608 00241 ∂26-Jan-85 0900 JMC*
C00609 00242 ∂26-Jan-85 0959 AAAI-OFFICE@SUMEX-AIM.ARPA Re: council
C00611 00243 ∂26-Jan-85 2121 ATP.BLEDSOE@UTEXAS-20.ARPA Re: presidency
C00613 00244 ∂27-Jan-85 1400 @SU-SCORE.ARPA:pratt@Navajo coat left
C00614 00245 ∂27-Jan-85 1619 GOGUEN@SRI-AI.ARPA party!
C00616 00246 ∂27-Jan-85 1620 GOGUEN@SRI-AI.ARPA party!
C00618 00247 ∂27-Jan-85 2121 RPG Qlambda paper
C00619 00248 ∂27-Jan-85 2320 HST gwai-invited talk
C00620 00249 ∂28-Jan-85 0816 AAAI-OFFICE@SUMEX-AIM.ARPA By-law amendments
C00622 00250 ∂28-Jan-85 0901 JMC*
C00623 00251 ∂28-Jan-85 0909 RESTIVO@SU-SCORE.ARPA CS226
C00624 00252 ∂28-Jan-85 1023 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 reminder
C00626 00253 ∂28-Jan-85 1058 GOLUB@SU-SCORE.ARPA Visit by Alan George
C00627 00254 ∂28-Jan-85 1118 RA trip to Vienna
C00628 00255 ∂28-Jan-85 1123 RA
C00629 00256 ∂28-Jan-85 1201 @SU-SCORE.ARPA:FFL@SU-AI.ARPA e
C00630 00257 ∂28-Jan-85 1228 RA Vienna trip
C00632 00258 ∂28-Jan-85 1313 LIBRARY@SU-SCORE.ARPA Lasers in Graphics Electronic Publishing in the 80's Conf. 1983
C00633 00259 ∂28-Jan-85 1323 JJW Major LP Milestone Set In Place
C00638 00260 ∂28-Jan-85 1323 RA
C00639 00261 ∂28-Jan-85 1459 RA
C00640 00262 ∂28-Jan-85 1538 TAJNAI@SU-SCORE.ARPA Change in Session II
C00642 00263 ∂28-Jan-85 1554 mogul@Navajo Re: CSD facilities
C00645 00264 ∂28-Jan-85 1629 TAJNAI@SU-SCORE.ARPA Visitors
C00647 00265 ∂29-Jan-85 0840 RA
C00648 00266 ∂29-Jan-85 0900 JMC*
C00649 00267 ∂29-Jan-85 0919 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
C00651 00268 ∂29-Jan-85 1226 sun!aster!pratt@Berkeley parking
C00655 00269 ∂29-Jan-85 1319 ullman@diablo Shapiro
C00656 00270 ∂29-Jan-85 1236 KUO job and paper
C00659 00271 ∂29-Jan-85 1408 BARWISE@SU-CSLI.ARPA Tea Tomorrow
C00661 00272 ∂29-Jan-85 1446 RA
C00664 00273 ∂29-Jan-85 1449 RA
C00665 00274 ∂29-Jan-85 1539 JJW Reply problem
C00670 00275 ∂29-Jan-85 1543 RA
C00673 00276 ∂29-Jan-85 1642 NILSSON@SU-SCORE.ARPA What have you done lately?
C00675 00277 ∂29-Jan-85 1645 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C00677 00278 ∂29-Jan-85 2017 BH exclamation point in net address
C00678 00279 ∂30-Jan-85 0856 NILSSON@SU-SCORE.ARPA Robotics Committee
C00680 00280 ∂30-Jan-85 0900 JMC*
C00681 00281 ∂30-Jan-85 0941 ARIADNE@SU-SCORE.ARPA CS colloquium: Despain Prolog Machine, Feb. 5
C00685 00282 ∂30-Jan-85 1000 JMC*
C00686 00283 ∂30-Jan-85 1007 LIBRARY@SU-SCORE.ARPA Idaho State University Conference on Automated Reasoning and Expert Systems
C00688 00284 ∂30-Jan-85 1015 @SU-SCORE.ARPA:FFL@SU-AI.ARPA Space Needs Review
C00690 00285 ∂30-Jan-85 1051 @SU-SCORE.ARPA:FFL@SU-AI.ARPA Walking tour on space needs
C00691 00286 ∂30-Jan-85 1149 RA
C00692 00287 ∂30-Jan-85 1156 sun!aster!pratt@Berkeley re: parking
C00694 00288 ∂30-Jan-85 1214 GOLUB@SU-SCORE.ARPA Re: Space Needs Review
C00695 00289 ∂30-Jan-85 1306 FFL
C00696 00290 ∂30-Jan-85 1307 GOLUB@SU-SCORE.ARPA FORSYTHE LECTURE TONIGHT!
C00698 00291 ∂30-Jan-85 1412 VAL grosof's work
C00699 00292 ∂30-Jan-85 1421 REGES@SU-SCORE.ARPA
C00700 00293 ∂30-Jan-85 1424 RA
C00701 00294 ∂30-Jan-85 1505 REGES@SU-SCORE.ARPA Re: reply to message
C00702 00295 ∂30-Jan-85 1646 RA
C00703 00296 ∂31-Jan-85 0007 ERIC@SU-CSLI.ARPA Re: credit
C00704 00297 ∂31-Jan-85 0839 BARWISE@SU-CSLI.ARPA Notes on yesterday's tea:
C00719 00298 ∂31-Jan-85 0844 BARWISE@SU-CSLI.ARPA notes on yesteday's tea
C00720 00299 ∂31-Jan-85 1038 AAAI-OFFICE@SUMEX-AIM.ARPA List of Officers and former officers
C00730 00300 ∂31-Jan-85 1244 @SU-SCORE.ARPA:WALESON@SUMEX-AIM.ARPA Lou Fein
C00732 00301 ∂01-Feb-85 0903 BARWISE@SU-CSLI.ARPA Topics for tea?
C00733 00302 ∂01-Feb-85 0912 NILSSON@SU-SCORE.ARPA Re: Lou Fein
C00735 00303 ∂01-Feb-85 1517 RA
C00736 00304 ∂01-Feb-85 1519 RA
C00737 00305 ∂01-Feb-85 1522 RA
C00738 00306 ∂01-Feb-85 1532 RA
C00739 00307 ∂01-Feb-85 1656 SJG counterfactuals
C00740 00308 ∂01-Feb-85 1705 RA
C00741 00309 ∂02-Feb-85 1051 RPG Machine decision
C00743 00310 ∂03-Feb-85 1540 NILSSON@SU-SCORE.ARPA CS224
C00746 00311 ∂03-Feb-85 1742 ME Prancing Pony Bill
C00748 00312 ∂04-Feb-85 0812 RA
C00749 00313 ∂04-Feb-85 0828 JOHN@SU-CSLI.ARPA metaphorical meaning
C00750 00314 ∂04-Feb-85 0956 BMOORE@SRI-AI.ARPA Re: [John McCarthy <JMC@SU-AI.ARPA>: logic and ai ]
C00752 00315 ∂04-Feb-85 1107 VAL strips
C00753 00316 ∂04-Feb-85 1114 HI.RICH@MCC.ARPA Re: fantasy finally
C00755 00317 ∂04-Feb-85 1707 CLT meeting
C00756 00318 ∂04-Feb-85 2044 JJW Thesis
C00757 00319 ∂04-Feb-85 2116 JJW Sequent
C00762 00320 ∂05-Feb-85 0636 NILSSON@SU-SCORE.ARPA Robotics Committee
C00764 00321 ∂05-Feb-85 0825 NILSSON@SU-SCORE.ARPA CS224
C00765 00322 ∂05-Feb-85 1044 DAVIES@SU-SIERRA.ARPA Berkeley workshop
C00767 00323 ∂05-Feb-85 1057 RA
C00768 00324 ∂05-Feb-85 1145 RPG Berkeley workshop
C00770 00325 ∂05-Feb-85 1228 VAL formalization of strips
C00771 00326 ∂05-Feb-85 1248 VAL additional axiom for strips
C00772 00327 ∂05-Feb-85 1447 perlis@tove bibliography
C00794 00328 ∂05-Feb-85 1452 perlis@tove biblio clean version
C00818 00329 ∂05-Feb-85 1622 RA
C00819 00330 ∂05-Feb-85 1629 RA
C00820 00331 ∂05-Feb-85 2323 SG My father-in-law / Japan
C00821 00332 ∂05-Feb-85 2335 FY LISP machine in #324
C00822 00333 ∂06-Feb-85 0802 perlis@tove slithy things
C00825 00334 ∂06-Feb-85 0935 BOSACK@SU-SCORE.ARPA Re: LISP machine in #324
C00826 00335 ∂06-Feb-85 1000 JMC*
C00827 00336 ∂06-Feb-85 1015 LIBRARY@SU-SCORE.ARPA A Sociological Look at AI Research
C00831 00337 ∂06-Feb-85 1704 RA
C00832 00338 ∂06-Feb-85 1701 KUO Reference
C00833 00339 ∂06-Feb-85 1736 BSCOTT@SU-SCORE.ARPA McCarthy ARPA Contract
C00837 00340 ∂06-Feb-85 2000 JOHN@SU-CSLI.ARPA Memorandum
C00850 00341 ∂06-Feb-85 2311 SG My father-in-law (addendum)
C00851 00342 ∂07-Feb-85 0830 JOHN@SU-CSLI.ARPA p.s.
C00852 00343 ∂07-Feb-85 0900 JMC*
C00853 00344 ∂07-Feb-85 0937 AI.WOODY@MCC.ARPA Your Visit
C00855 00345 ∂07-Feb-85 1458 AAAI@SRI-AI.ARPA Draft Amendment
C00858 00346 ∂07-Feb-85 1531 SMC phone msg
C00859 00347 ∂07-Feb-85 1808 LLW@S1-A.ARPA Interview Appointment
C00861 00348 ∂07-Feb-85 1947 avg@diablo re: Russell Baker on Word Processing (from SAIL's BBOARD)
C00862 00349 ∂07-Feb-85 2357 SF@SU-CSLI.ARPA Re: NSF travel grant to Japan
C00863 00350 ∂08-Feb-85 0256 LES
C00874 00351 ∂08-Feb-85 0846 FISHER@SU-SCORE.ARPA re: Russell Baker on Word Processing (from SAIL's BBOARD)
C00875 00352 ∂08-Feb-85 0917 TULEY@SU-SCORE.ARPA message
C00876 00353 ∂08-Feb-85 1120 RA
C00877 00354 ∂08-Feb-85 1251 RA
C00878 00355 ∂08-Feb-85 1330 LAUBE@SU-SCORE.ARPA Re: project
C00879 00356 ∂08-Feb-85 1437 ROISTACHER@SU-SCORE.ARPA Techpsych
C00883 00357 ∂08-Feb-85 1503 RA
C00884 00358 ∂08-Feb-85 1524 BSCOTT@SU-SCORE.ARPA Meeting to discuss McCarthy contract reimbursement
C00886 00359 ∂08-Feb-85 1559 CLT ce soir
C00888 00360 ∂08-Feb-85 2128 LES Lucid prose
C00889 00361 ∂09-Feb-85 1016 CLT Our proposal
C00891 00362 ∂09-Feb-85 1716 TREITEL@SUMEX-AIM.ARPA re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
C00893 00363 ∂10-Feb-85 0901 JMC*
C00894 00364 ∂10-Feb-85 1139 TYSON@SRI-AI.ARPA re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
C00896 00365 ∂10-Feb-85 1558 NILSSON@SU-SCORE.ARPA cs224
C00897 00366 ∂10-Feb-85 2339 HST gwai85
C00898 00367 ∂11-Feb-85 0900 JMC*
C00899 00368 ∂11-Feb-85 0900 JMC*
C00900 00369 ∂11-Feb-85 0951 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
C00902 00370 ∂11-Feb-85 1028 RA FORUM activities
C00903 00371 ∂11-Feb-85 1318 RA billing MCC
C00904 00372 ∂11-Feb-85 1400 RA lunch bukowsky
C00905 00373 ∂11-Feb-85 1546 CLT laube
C00906 00374 ∂11-Feb-85 1615 ullman@diablo
C00907 00375 ∂11-Feb-85 1643 RA Les Earnest
C00908 00376 ∂11-Feb-85 1732 PEREIRA@SRI-AI.ARPA Re: industrial lectureship
C00910 00377 ∂12-Feb-85 0606 JJW LaBrea
C00911 00378 ∂12-Feb-85 1014 VAL normal form for monadic formulas
C00912 00379 ∂12-Feb-85 1307 ME
C00913 00380 ∂12-Feb-85 1344 RA your work in AI
C00914 00381 ∂12-Feb-85 1426 RA Oliver Selfridge
C00915 00382 ∂12-Feb-85 1432 RA AI faculty meeting
C00916 00383 ∂12-Feb-85 1454 GLB
C00917 00384 ∂12-Feb-85 1506 VAL seminar on circumscription
C00918 00385 ∂12-Feb-85 1516 RESTIVO@SU-SCORE.ARPA Chess and EKL
C00919 00386 ∂12-Feb-85 1546 RA buffet
C00920 00387 ∂12-Feb-85 1552 AI.WOODY@MCC.ARPA re: Your Visit
C00921 00388 ∂12-Feb-85 1621 RESTIVO@SU-SCORE.ARPA re: Chess and EKL
C00923 00389 ∂12-Feb-85 1623 BSCOTT@SU-SCORE.ARPA McCarthy Contract
C00926 00390 ∂12-Feb-85 1657 LIBRARY@SU-SCORE.ARPA Journal of Automated Reasoning
C00927 00391 ∂12-Feb-85 1743 CLT burge
C00928 00392 ∂12-Feb-85 1954 BARWISE@SU-CSLI.ARPA An ad hoc talk about SASL
C00930 00393 ∂13-Feb-85 0034 cheriton@Pescadero Facilities committee meeting
C00932 00394 ∂13-Feb-85 0043 JDLH@SU-SCORE.ARPA Re: Facilities committee meeting
C00935 00395 ∂13-Feb-85 0112 JMC@SU-AI.ARPA In defense of dinosaurs, i.e. time-sharing
C00940 00396 ∂13-Feb-85 0235 GROSOF@SU-SCORE.ARPA Re: In defense of dinosaurs, i.e. time-sharing
C00941 00397 ∂13-Feb-85 0641 HI.RICH@MCC.ARPA Re: fantasy in HCN
C00942 00398 ∂13-Feb-85 1002 RA REASON subscription
C00943 00399 ∂13-Feb-85 1008 tasar@Camelot test
C00944 00400 ∂13-Feb-85 1057 RA David Chudnovsky
C00945 00401 ∂13-Feb-85 1149 RESTIVO@SU-SCORE.ARPA re: Chess and EKL
C00946 00402 ∂13-Feb-85 1222 CLT msg
C00947 00403 ∂13-Feb-85 1315 JJW Qlambda question
C00949 00404 ∂13-Feb-85 1333 RA Austin tickets
C00950 00405 ∂13-Feb-85 1340 RA academy lunch
C00951 00406 ∂13-Feb-85 1601 AAAI-OFFICE@SUMEX-AIM.ARPA Cooperation Draft
C00962 00407 ∂13-Feb-85 1802 NILSSON@SU-SCORE.ARPA Re: reference
C00964 00408 ∂13-Feb-85 1950 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Special Seminar in Logic and Foundations
C00966 00409 ∂14-Feb-85 0835 RA movie
C00967 00410 ∂14-Feb-85 0932 RA CS Search Committe
C00968 00411 ∂14-Feb-85 1017 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting summary
C00973 00412 ∂14-Feb-85 1055 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C00976 00413 ∂14-Feb-85 1101 FFL
C00979 00414 ∂14-Feb-85 1139 SELLS@SU-CSLI.ARPA Chomsky book
C00980 00415 ∂14-Feb-85 1149 NILSSON@SU-SCORE.ARPA $400K
C00982 00416 ∂14-Feb-85 1238 AI.WOODY@MCC.ARPA Re: result already known
C00983 00417 ∂14-Feb-85 1326 JJW Closures
C00986 00418 ∂15-Feb-85 1133 JJW Qlambda
C00988 00419 ∂15-Feb-85 1501 CHRIS@SU-CSLI.ARPA Hintikka lunch
C00990 00420 ∂15-Feb-85 2134 SG I will be out of office.
C00991 00421 ∂16-Feb-85 0730 ATP.BLEDSOE@UTEXAS-20.ARPA [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
C00997 00422 ∂17-Feb-85 2007 RESTIVO@SU-SCORE.ARPA
C00998 00423 ∂17-Feb-85 2337 HST gwai85
C00999 00424 ∂18-Feb-85 0732 AI.WOODY@MCC.ARPA Your visit
C01001 00425 ∂18-Feb-85 1000 JMC*
C01002 00426 ∂18-Feb-85 1006 Bobrow.pa@Xerox.ARPA Re: industry lectureship
C01003 00427 ∂18-Feb-85 1149 WASOW@SU-CSLI.ARPA clarification about summer RAships
C01007 00428 ∂18-Feb-85 2226 CLT qproposal
C01008 00429 ∂19-Feb-85 0838 JOHN@SU-CSLI.ARPA Re: use of dandelions for a course
C01010 00430 ∂19-Feb-85 1310 RA LA trip
C01011 00431 ∂19-Feb-85 1311 RA AI and genetics
C01012 00432 ∂19-Feb-85 1330 RA Susan McCarthy
C01013 00433 ∂19-Feb-85 1500 JMC*
C01014 00434 ∂19-Feb-85 1503 DAVIES@SUMEX-AIM.ARPA HPP Architecture Project Meeting
C01016 00435 ∂19-Feb-85 1504 RA Circumscription seminar
C01017 00436 ∂19-Feb-85 1543 DEK prereq for 258
C01018 00437 ∂19-Feb-85 1600 JMC*
C01019 00438 ∂19-Feb-85 1633 RA Livermore
C01020 00439 ∂19-Feb-85 1756 EJS
C01021 00440 ∂19-Feb-85 2001 RESTIVO@SU-SCORE.ARPA
C01022 00441 ∂19-Feb-85 2029 FEIGENBAUM@SUMEX-AIM.ARPA [<AJM@LL.ARPA>: Proposed Visit to Discuss LL Staffer for HPP Project]
C01028 00442 ∂19-Feb-85 2126 EJS
C01029 00443 ∂19-Feb-85 2256 cheriton@Pescadero CSD Facilities meeting
C01031 00444 ∂20-Feb-85 0753 NILSSON@SU-SCORE.ARPA Friday
C01034 00445 ∂20-Feb-85 0806 BARWISE@SU-CSLI.ARPA Acknowledgements
C01038 00446 ∂20-Feb-85 0833 NII@SUMEX-AIM.ARPA Re: [<AJM@LL.ARPA>: Proposed Visit to Discuss LL Staffer for HPP Project]
C01040 00447 ∂20-Feb-85 0934 CLT Kronos
C01041 00448 ∂20-Feb-85 1043 RA ENCORE
C01042 00449 ∂20-Feb-85 1135 ullman@diablo Parallelism White Paper
C01044 00450 ∂20-Feb-85 1354 RA Barbacue of Louis
C01045 00451 ∂20-Feb-85 1408 RA MAD
C01046 00452 ∂20-Feb-85 1529 TULEY@SU-SCORE.ARPA msg's
C01047 00453 ∂20-Feb-85 1743 PEREIRA@SRI-AI.ARPA Proposed course
C01050 00454 ∂21-Feb-85 0052 LES Draft proposal
C01051 00455 ∂21-Feb-85 0819 BUCHANAN@SUMEX-AIM.ARPA Industrial Professorship
C01053 00456 ∂21-Feb-85 0901 NILSSON@SU-SCORE.ARPA Re: Proposed course
C01054 00457 ∂21-Feb-85 0929 DAVIES@SU-SIERRA.ARPA Parallel Computing Survey -- First Round
C01066 00458 ∂21-Feb-85 0934 RA Austin trip December
C01067 00459 ∂21-Feb-85 1135 BETSY@SU-CSLI.ARPA Tip
C01069 00460 ∂21-Feb-85 1149 RA Dr. King
C01070 00461 ∂21-Feb-85 1252 RA adams.2
C01071 00462 ∂21-Feb-85 1258 cheriton@Pescadero Meeting in Chairman conference room and ..
C01088 00463 ∂21-Feb-85 1341 ME AP back up
C01089 00464 ∂21-Feb-85 1353 RA leave early
C01090 00465 ∂21-Feb-85 1430 INGRID@SU-CSLI.ARPA CSLI Summer School and ASL Meeting
C01092 00466 ∂21-Feb-85 1446 VAL Circumscription seminar
C01093 00467 ∂21-Feb-85 1447 INGRID@SU-CSLI.ARPA re: CSLI Summer School and ASL Meeting
C01094 00468 ∂21-Feb-85 1612 NISSENBAUM@SU-CSLI.ARPA Comments
C01097 00469 ∂21-Feb-85 1904 SMC
C01098 00470 ∂21-Feb-85 2136 BARWISE@SU-CSLI.ARPA Reminder
C01099 00471 ∂21-Feb-85 2318 JJW Rest of the facilities meeting
C01101 00472 ∂22-Feb-85 0922 TULEY@SU-SCORE.ARPA CS Search Committee Meeting
C01102 00473 ∂22-Feb-85 0952 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA Re: next F4 meeting
C01105 00474 ∂22-Feb-85 1026 SJG counterfactuals
C01106 00475 ∂22-Feb-85 1108 VARDI@SU-CSLI.ARPA Possible-Worlds Semantics for Modal Logic
C01110 00476 ∂22-Feb-85 1136 TAJNAI@SU-SCORE.ARPA SunNet
C01111 00477 ∂22-Feb-85 1142 TAJNAI@SU-SCORE.ARPA re: SunNet
C01112 00478 ∂22-Feb-85 1500 JMC*
C01113 00479 ∂22-Feb-85 1619 ullman@diablo Re: A Center for ...
C01114 00480 ∂22-Feb-85 1700 RA AP president
C01115 00481 ∂22-Feb-85 1802 VARDI@SU-CSLI.ARPA Internal Semantics and Kaplan's Intensional Logic
C01117 00482 ∂23-Feb-85 1328 NILSSON@SU-SCORE.ARPA Alan Kay
C01119 00483 ∂23-Feb-85 1647 NILSSON@SU-SCORE.ARPA re: Alan Kay
C01121 00484 ∂25-Feb-85 1029 SJG counterfactuals
C01122 00485 ∂25-Feb-85 1034 SJG dinner
C01123 00486 ∂25-Feb-85 1101 SJG short week!
C01124 00487 ∂25-Feb-85 1302 TULEY@SU-SCORE.ARPA msg
C01125 00488 ∂25-Feb-85 1354 JJW Multiprocessor Lisp
C01126 00489 ∂25-Feb-85 1447 DEK
C01127 00490 ∂25-Feb-85 1513 NILSSON@SU-SCORE.ARPA Re: Nilsson
C01128 00491 ∂25-Feb-85 1531 RA AI and speech recoognition
C01129 00492 ∂25-Feb-85 1550 williams.sjrlvm1%ibm-sj.csnet@csnet-relay.arpa FP course description
C01131 00493 ∂25-Feb-85 2201 JJW@SU-AI.ARPA Software development proposal
C01137 00494 ∂25-Feb-85 2235 JJW@SU-AI.ARPA Software development proposal, cont'd.
C01140 00495 ∂26-Feb-85 0007 ROODE@SRI-NIC.ARPA [Francine Perillo <PERILLO@SRI-NIC.ARPA>: [krovetz@nlm-mcs (Bob Krovetz): online technical reports]]
C01151 00496 ∂26-Feb-85 0925 BETSY@SU-CSLI.ARPA Budget Cuts
C01154 00497 ∂26-Feb-85 1002 @SRI-AI.ARPA:AAAI-OFFICE@SUMEX-AIM.ARPA Term of the Chairs and the Secretary-Treasurer
C01157 00498 ∂26-Feb-85 1023 Stefik.pa@Xerox.ARPA CS 390 -- 2nd time around
C01159 00499 ∂26-Feb-85 1023 Stefik.pa@Xerox.ARPA CS 390
C01161 00500 ∂26-Feb-85 1035 DEK I got Stefik's note just in time, and...
C01162 00501 ∂26-Feb-85 1053 LEP Industrial Lectureship Committee
C01164 00502 ∂26-Feb-85 1130 RA MAD
C01165 00503 ∂26-Feb-85 1146 NILSSON@SU-SCORE.ARPA Re: industrial lectureships
C01167 00504 ∂26-Feb-85 1158 BSCOTT@SU-SCORE.ARPA Joint U.S.-Japanese Cooperative Research
C01168 00505 ∂26-Feb-85 1355 DEK
C01173 00506 ∂26-Feb-85 1430 FY LISP machine
C01174 00507 ∂26-Feb-85 1438 VAL
C01175 00508 ∂26-Feb-85 1506 NILSSON@SU-SCORE.ARPA [NAVARRO@SRI-AI.ARPA: missing keys]
C01178 00509 ∂26-Feb-85 1546 CHRIS@SU-CSLI.ARPA Hintikka lunch
C01179 00510 ∂26-Feb-85 1614 RA Les Earnest
C01180 00511 ∂27-Feb-85 0900 JMC*
C01181 00512 ∂27-Feb-85 0910 JMC*
C01182 00513 ∂27-Feb-85 1125 RA John Nafeh
C01183 00514 ∂27-Feb-85 1126 RA press release follow up
C01184 00515 ∂27-Feb-85 1442 RA [Reply to message recvd: 27 Feb 85 13:57-PST]
C01185 00516 ∂27-Feb-85 1452 RA John Nafeh
C01186 00517 ∂27-Feb-85 2251 LLW@S1-A.ARPA "Hail, Anubis, . . . "
C01189 00518 ∂27-Feb-85 2309 LLW@S1-A.ARPA 'Tis Far More Blessed To Win Than To Lose. . .
C01191 00519 ∂28-Feb-85 0030 FEIGENBAUM@SUMEX-AIM.ARPA Bob Kahn getogether
C01193 00520 ∂28-Feb-85 0859 WIEDERHOLD@SUMEX-AIM.ARPA Industrial lecturers
C01194 00521 ∂28-Feb-85 0930 yorick%nmsu.csnet@csnet-relay.arpa
C01195 00522 ∂28-Feb-85 0951 JMC
C01196 00523 ∂28-Feb-85 0950 RA John Nafeh
C01197 00524 ∂28-Feb-85 1026 VAL Circumscription seminar
C01198 00525 ∂28-Feb-85 1136 RA Speech recognition
C01199 00526 ∂28-Feb-85 1249 SJG Thursday is upon us!
C01200 00527 ∂28-Feb-85 1435 RA
C01201 00528 ∂28-Feb-85 1542 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA paper for the next F4 meeting
C01203 00529 ∂28-Feb-85 1553 SJG dinner
C01204 00530 ∂28-Feb-85 1751 RINDFLEISCH@SUMEX-AIM.ARPA Re: Bob Kahn getogether
C01205 00531 ∂28-Feb-85 1936 BARWISE@SU-CSLI.ARPA Kit Fine
C01206 00532 ∂28-Feb-85 2003 cheriton@Pescadero Mail problem
C01210 00533 ∂28-Feb-85 2100 JMC*
C01211 00534 ∂28-Feb-85 2238 REGES@SU-SCORE.ARPA
C01212 00535 ∂28-Feb-85 2259 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
C01214 00536 ∂01-Mar-85 0511 OHLANDER@USC-ISI.ARPA Re: Nilsson
C01216 00537 ∂01-Mar-85 0842 BARWISE@SU-CSLI.ARPA David Harel
C01218 00538 ∂01-Mar-85 0853 FFL Search Committee meeting
C01219 00539 ∂01-Mar-85 0911 STAN@SRI-AI.ARPA Re: David Harel
C01221 00540 ∂01-Mar-85 1016 INGRID@SU-CSLI.ARPA Abstract for Summer School
C01222 00541 ∂01-Mar-85 1224 AAAI-OFFICE@SUMEX-AIM.ARPA Two Recommendations from the Conference Committee
C01240 00542 ∂01-Mar-85 1546 LES DARPA proposal
C01241 00543 ∂02-Mar-85 0823 BUCHANAN@SUMEX-AIM.ARPA Re: Two Recommendations from the Conference Committee
C01244 00544 ∂02-Mar-85 1648 ME Prancing Pony Bill
C01246 00545 ∂03-Mar-85 0756 AS80@CMU-CS-A.ARPA RE: any literature on history of ideas in Computer Science
C01248 00546 ∂03-Mar-85 1451 @SU-CSLI.ARPA:harel%wisdom.bitnet@WISCVM.ARPA
C01250 00547 ∂03-Mar-85 1732 @SU-CSLI.ARPA:pratt@Navajo Re: Possible-Worlds Semantics for Modal Logic
C01266 00548 ∂03-Mar-85 1737 RICH%MIT-OZ@MIT-MC.ARPA AAAI Cooperation Policy
C01270 00549 ∂03-Mar-85 1919 JJW Common Lisp
C01271 00550 ∂04-Mar-85 0813 RICH%MIT-OZ@MIT-MC.ARPA Two AAAI Conferences
C01274 00551 ∂04-Mar-85 0900 JMC*
C01275 00552 ∂04-Mar-85 0900 JMC*
C01276 00553 ∂04-Mar-85 0948 NILSSON@SU-SCORE.ARPA Tom
C01277 00554 ∂04-Mar-85 1017 AAAI-OFFICE@SUMEX-AIM.ARPA List of Councilors
C01287 00555 ∂04-Mar-85 1051 VARDI@SU-CSLI.ARPA Modal Logic
C01289 00556 ∂04-Mar-85 1322 Stefik.pa@Xerox.ARPA Re: Two Recommendations from the Conference Committee
C01294 00557 ∂04-Mar-85 1400 JMC*
C01295 00558 ∂04-Mar-85 1612 RA picture-taking time
C01296 00559 ∂04-Mar-85 1652 RA Suppes
C01297 00560 ∂04-Mar-85 1658 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C01298 00561 ∂05-Mar-85 0703 AMAREL@RUTGERS.ARPA Re: Two Recommendations from the Conference Committee
C01302 00562 ∂05-Mar-85 0902 @SRI-AI.ARPA:stefik.pa@Xerox.ARPA Re: Term of the Chairs and the Secretary-Treasurer
C01305 00563 ∂05-Mar-85 0949 FEIGENBAUM@SUMEX-AIM.ARPA need for meeting TODAY (unfortunately)
C01307 00564 ∂05-Mar-85 0951 NII@SUMEX-AIM.ARPA Re: need for meeting TODAY (unfortunately)
C01308 00565 ∂05-Mar-85 1045 RPG Meeting
C01309 00566 ∂05-Mar-85 1242 JJW Lisp Machine disk
C01311 00567 ∂05-Mar-85 1310 FFL Next Robotics Search Committee meeting
C01312 00568 ∂05-Mar-85 1344 TULEY@SU-SCORE.ARPA msg
C01313 00569 ∂05-Mar-85 1408 RA Mike Magill
C01315 00570 ∂05-Mar-85 1512 BUCHANAN@SUMEX-AIM.ARPA Joseph Edozien
C01316 00571 ∂05-Mar-85 1612 Tenenbaum@SRI-KL.ARPA Re: Two AAAI Conferences
C01319 00572 ∂05-Mar-85 1626 Tenenbaum@SRI-KL.ARPA Re: Two Recommendations from the Conference Committee
C01326 00573 ∂05-Mar-85 1632 BSCOTT@SU-SCORE.ARPA Final Report
C01327 00574 ∂05-Mar-85 1727 NILSSON@SU-SCORE.ARPA Brady Visit
C01329 00575 ∂05-Mar-85 1838 Tenenbaum@SRI-KL.ARPA Re: Two Recommendations from the Conference Committee
C01332 00576 ∂05-Mar-85 1927 @SU-CSLI.ARPA:pratt@Navajo Re: Modal Logic
C01335 00577 ∂05-Mar-85 2116 JJW Summer plans
C01337 00578 ∂06-Mar-85 0847 LOUNGO@RUTGERS.ARPA January 1985 Mailing
C01341 00579 ∂06-Mar-85 1207 RTC Job Reference
C01342 00580 ∂06-Mar-85 1347 AAAI-OFFICE@SUMEX-AIM.ARPA Minutes from the 1984 Publication Committee Meeting
C01349 00581 ∂06-Mar-85 1440 RA insurance form
C01350 00582 ∂06-Mar-85 1739 NILSSON@SU-SCORE.ARPA Brady Visit
C01352 00583 ∂06-Mar-85 1904 WITHGOTT@SU-CSLI.ARPA Informal gathering to discuss representations (1)
C01354 00584 ∂06-Mar-85 1950 CL.BOYER@UTEXAS-20.ARPA dinosaurs
C01355 00585 ∂07-Mar-85 0344 YM two questions
C01356 00586 ∂07-Mar-85 0945 VARDI@SU-CSLI.ARPA Re: Modal Logic
C01358 00587 ∂07-Mar-85 1100 RA Herbert Greenberg
C01359 00588 ∂07-Mar-85 1143 VAL Circumscription seminar
C01360 00589 ∂07-Mar-85 1145 STAN@SRI-AI.ARPA Gaifman
C01362 00590 ∂07-Mar-85 1230 EENGELMORE@SUMEX-AIM.ARPA Reminder/Delaney/Lincoln/3-11
C01364 00591 ∂07-Mar-85 1309 NISSENBAUM@SU-CSLI.ARPA CSLI Seminar
C01365 00592 ∂07-Mar-85 1329 NILSSON@SU-SCORE.ARPA [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: Robotics Applicants]
C01368 00593 ∂07-Mar-85 1343 FFL Meeting of Search Committee with candidate, Marc Raibert
C01369 00594 ∂07-Mar-85 1346 NII@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
C01371 00595 ∂07-Mar-85 1425 RINDFLEISCH@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
C01372 00596 ∂07-Mar-85 1439 RA leave early
C01373 00597 ∂07-Mar-85 1507 EENGELMORE@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
C01375 00598 ∂07-Mar-85 1511 CWR reference
C01376 00599 ∂07-Mar-85 1527 DELAGI@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
C01377 00600 ∂08-Mar-85 0643 @MIT-MC:RICH@MIT-OZ AAAI Conference Proposals
C01383 00601 ∂08-Mar-85 0829 JJW Eagle drives for 3600s
C01385 00602 ∂08-Mar-85 0915 RA Computer Science Chairperson for UC Davis
C01386 00603 ∂08-Mar-85 1107 LES Random events and queries
C01387 00604 ∂08-Mar-85 1138 RA looking for you
C01388 00605 ∂08-Mar-85 1544 Tenenbaum@SRI-KL.ARPA Re: AAAI Conference Proposals
C01391 00606 ∂08-Mar-85 1628 RA Talk at American Acad. lunch group
C01392 00607 ∂08-Mar-85 1654 CLT
C01393 00608 ∂09-Mar-85 1251 GOGUEN@SU-CSLI.ARPA Re: David Harel
C01395 00609 ∂10-Mar-85 1214 CLT fine
C01396 00610 ∂10-Mar-85 1504 reiter%ubc.csnet@csnet-relay.arpa ijcai award
C01398 00611 ∂11-Mar-85 0835 BARWISE@SU-CSLI.ARPA Re: talking in my class
C01400 00612 ∂11-Mar-85 0900 JMC*
C01401 00613 ∂11-Mar-85 1003 VAL employment with Stanford
C01402 00614 ∂11-Mar-85 1009 CLT okner
C01403 00615 ∂11-Mar-85 1010 CLT
C01404 00616 ∂11-Mar-85 1015 EENGELMORE@SUMEX-AIM.ARPA RE: Delaney/Lincoln
C01406 00617 ∂11-Mar-85 1101 RA a visit by Dr. Winter from DFLVR
C01407 00618 ∂11-Mar-85 1223 RR29@CMU-CS-A.ARPA Resnick's phone number
C01409 00619 ∂11-Mar-85 1314 BSCOTT@SU-SCORE.ARPA Re: offer to Vladimir Lifschitz
C01411 00620 ∂11-Mar-85 1315 RR29@CMU-CS-A.ARPA Dan Resnick
C01413 00621 ∂11-Mar-85 1342 RA Some expert systems need common sense
C01414 00622 ∂11-Mar-85 1405 RA Inference, meeting Friday
C01415 00623 ∂11-Mar-85 1522 CLT
C01416 00624 ∂12-Mar-85 0923 CLT
C01417 00625 ∂12-Mar-85 1240 RA Visitors from mainland China
C01418 00626 ∂12-Mar-85 1352 RA MYCIN
C01419 00627 ∂12-Mar-85 1408 RA tickets
C01420 00628 ∂12-Mar-85 1431 RA AAAI conference
C01421 00629 ∂12-Mar-85 1441 RA ffice of Research and Development in an interested party to it.
C01422 00630 con-Mar-85 1457 RA Queue-based multi-processing lisp paper
C01423 00631 ∂12-Mar-85 1502 RA
C01424 00632 ∂13-Mar-85 2140 RPG AAAI-86
C01425 00633 ∂14-Mar-85 0900 JMC*
C01426 00634 ∂14-Mar-85 0950 FFL NEW PHONE
C01427 00635 ∂14-Mar-85 1113 LAMPING@SU-SCORE.ARPA Prospective Student Visit
C01428 00636 ∂14-Mar-85 1121 reid@Glacier lisp birthday?
C01429 00637 ∂14-Mar-85 1409 VAL Circumscription seminar
C01430 00638 ∂14-Mar-85 1459 VAL Circumscription seminar
C01431 00639 ∂14-Mar-85 1655 THEODOROU@SU-SCORE.ARPA PhD visit
C01432 00640 ∂15-Mar-85 1431 RA Australian minister of science
C01433 00641 ∂16-Mar-85 0406 derek%nmsu.csnet@csnet-relay.arpa
C01435 00642 ∂16-Mar-85 1333 JM01@CMU-CS-A.ARPA Re: Two Recommendations from the Conference Committee
C01440 00643 ∂16-Mar-85 1453 @MIT-MC:DAVIS@MIT-OZ Re: Two Recommendations from the Conference Committee
C01444 00644 ∂16-Mar-85 1532 JM01@CMU-CS-A.ARPA Re: Two Recommendations from the Conference Committee
C01448 00645 ∂16-Mar-85 1835 LES ARPA review
C01450 00646 ∂16-Mar-85 2228 LES Proposal
C01452 00647 ∂16-Mar-85 2326 gnelson@decwrl.ARPA Industrial Lecturer
C01454 00648 ∂17-Mar-85 0346 REGES@SU-SCORE.ARPA Re: CSD Faculty/Staff phone list
C01457 00649 ∂17-Mar-85 1029 CLT
C01458 00650 ∂17-Mar-85 1119 NILSSON@SU-SCORE.ARPA Student Prospect
C01460 00651 ∂17-Mar-85 1319 @MIT-MC:DAM%OZ@SCRC-RIVERSIDE [AGRE at OZ: NAIQ]
C01465 00652 ∂18-Mar-85 1055 RESTIVO@SU-SCORE.ARPA
C01466 00653 ∂18-Mar-85 1058 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
C01468 00654 ∂18-Mar-85 1100 JMC*
C01469 00655 ∂18-Mar-85 1120 JMC
C01470 00656 ∂18-Mar-85 1141 RA Prolog Conference
C01471 00657 ∂18-Mar-85 1216 SG Prof.Moto-oka / ICOT visitors
C01472 00658 ∂18-Mar-85 1400 JMC*
C01473 00659 ∂18-Mar-85 1414 SG Thank you / Prof.Moto-oka, ICOT
C01474 00660 ∂18-Mar-85 1423 selker.pa@Xerox.ARPA [Gunther.pa: Forum: Online Databases]
C01478 00661 ∂18-Mar-85 2008 BARWISE@SU-CSLI.ARPA Current postdocs
C01481 00662 ∂19-Mar-85 0200 JMC*
C01482 00663 ∂19-Mar-85 0843 BRONSTEIN@SU-SCORE.ARPA re: Stanford Computer Scientist sues DOD! (from SAIL's BBOARD)
C01484 00664 ∂19-Mar-85 1116 TULEY@SU-SCORE.ARPA Express Package
C01485 00665 ∂19-Mar-85 1135 RA express mail
C01486 00666 ∂19-Mar-85 1352 gnelson@decwrl.ARPA re: Industrial Lecturer
C01488 00667 ∂19-Mar-85 1417 RA Academic Senate ballot
C01489 00668 ∂19-Mar-85 1737 @SU-SCORE.ARPA:avg@diablo re: Stanford Computer Scientist sues DOD!
C01492 00669 ∂19-Mar-85 1853 avg@diablo Re: Silencing Johnson?
C01498 00670 ∂20-Mar-85 0738 @SU-SCORE.ARPA:AI.PETRIE@MCC.ARPA Emycin
C01504 00671 ∂20-Mar-85 1114 JJW@SU-AI.ARPA Results of name contest
C01506 00672 ∂20-Mar-85 1144 RA visit by Barry Jones (Australia)
C01507 00673 ∂20-Mar-85 1236 SSO.OWICKI@SU-SIERRA.ARPA Faculty candidate
C01508 00674 ∂20-Mar-85 1236 SSO.OWICKI@SU-SIERRA.ARPA abstract for Kale
C01511 00675 ∂20-Mar-85 1334 RA Invitation to participate
C01513 00676 ∂20-Mar-85 1544 JFODOR@SU-CSLI.ARPA DC escapade
C01565 00677 ∂20-Mar-85 1608 HEDGES@SU-SCORE.ARPA CCS 224 AI Seminar
C01569 00678 ∂20-Mar-85 1622 RA talk
C01570 00679 ∂20-Mar-85 1627 POSER@SU-CSLI.ARPA jfodor.doc
C01571 00680 ∂20-Mar-85 2240 cheriton@Pescadero Re: Results of name contest
C01572 00681 ∂21-Mar-85 0817 berglund@Pescadero Max Hailperin
C01574 00682 ∂21-Mar-85 0950 JDLH@SU-SCORE.ARPA Re: Results of name contest
C01576 00683 ∂21-Mar-85 1049 STUCKY@SU-CSLI.ARPA Funds for Link
C01578 00684 ∂21-Mar-85 1152 mogul@Navajo Re: Results of name contest
C01580 00685 ∂21-Mar-85 1306 Brachman@SRI-KL.ARPA Re: Two Recommendations from the Conference Committee
C01590 00686 ∂21-Mar-85 1558 JFODOR@SU-CSLI.ARPA NSF
C01642 00687 ∂21-Mar-85 1604 JFODOR@SU-CSLI.ARPA apologies
C01644 00688 ∂21-Mar-85 2101 WIEDERHOLD@SUMEX-AIM.ARPA Re: BBOARD
C01646 00689 ∂21-Mar-85 2312 @SRI-KL.ARPA:ENGELMORE@SUMEX-AIM.ARPA Re: Two Recommendations from the Conference Committee
C01649 00690 ∂22-Mar-85 0937 SCHAFFER@SU-SCORE.ARPA Visiting prospective student
C01650 00691 ∂22-Mar-85 1102 @SRI-KL.ARPA,@MIT-MC:RICH@MIT-OZ Two Recommendations from the Conference Committee
C01653 00692 ∂23-Mar-85 1138 @SRI-KL.ARPA:ENGELMORE@SUMEX-AIM.ARPA Re: Two Recommendations from the Conference Committee
C01656 00693 ∂23-Mar-85 1502 BSCOTT@SU-SCORE.ARPA Les Earnest Payment
C01659 00694 ∂25-Mar-85 1109 SCHAFFER@SU-SCORE.ARPA re: Visiting prospective student
C01660 00695 ∂25-Mar-85 1112 YOUM@SU-SIERRA.ARPA Regarding to TV interview
C01662 00696 ∂25-Mar-85 1014 JJW@SU-AI.ARPA Sushi
C01664 00697 ∂25-Mar-85 1538 YOM Orals
C01665 00698 ∂25-Mar-85 1625 RA copying dispute
C01666 00699 ∂25-Mar-85 1629 RA change in my schedule
C01667 00700 ∂25-Mar-85 1828 RESTIVO@SU-SCORE.ARPA interp[1,CWR]
C01668 00701 ∂25-Mar-85 1836 RESTIVO@SU-SCORE.ARPA re: interp[1,CWR]
C01669 00702 ∂25-Mar-85 2240 YOM Proposal
C01672 00703 ∂25-Mar-85 2350 YOM Adviser
C01673 00704 ∂26-Mar-85 0802 RA not feeling well
C01674 00705 ∂26-Mar-85 0941 VAL Circumscription seminar
C01675 00706 ∂26-Mar-85 1101 VAL Inferior implication
C01676 00707 ∂26-Mar-85 1138 VAL re: Inferior implication
C01678 00708 ∂26-Mar-85 1139 TULEY@SU-SCORE.ARPA msg
C01679 00709 ∂26-Mar-85 1205 VAL re: Inferior implication
C01680 00710 ∂26-Mar-85 1228 VAL text for AI course
C01681 00711 ∂26-Mar-85 1600 AAAI@SRI-AI.ARPA Reorganization of the NCAI Conference Format
C01693 00712 ∂27-Mar-85 1000 JMC*
C01694 00713 ∂27-Mar-85 1220 RTC EBOS
C01695 00714 ∂27-Mar-85 1327 RA MAD Computer
C01696 00715 ∂27-Mar-85 1500 JMC*
C01697 00716 ∂27-Mar-85 1511 LES
C01698 00717 ∂27-Mar-85 1535 RTC EBOS
C01699 00718 ∂27-Mar-85 1602 RTC EBOS
C01700 00719 ∂27-Mar-85 1615 LES Friday at 1pm
C01701 00720 ∂27-Mar-85 2056 RPG Meeting
C01702 00721 ∂28-Mar-85 0109 GROSOF@SU-SCORE.ARPA Re: diagnosis as circumscription
C01704 00722 ∂28-Mar-85 0856 RA meeting today
C01705 00723 ∂28-Mar-85 0936 RA Congress in Spain
C01706 00724 ∂28-Mar-85 1357 BOSACK@SU-SCORE.ARPA Facilities Manual
C01708 00725 ∂28-Mar-85 1357 RA leaving early
C01709 00726 ∂28-Mar-85 1411 HART@SRI-AI.ARPA Re: Reorganization of the NCAI Conference Format
C01711 00727 ∂28-Mar-85 1429 MOGUL@SU-SCORE.ARPA Re: Facilities Manual
C01713 00728 ∂28-Mar-85 1503 VAL consistency of circumscription
C01714 00729 ∂28-Mar-85 1527 JM01@CMU-CS-A.ARPA Re: Reorganization of the NCAI Conference Format
C01716 00730 ∂28-Mar-85 2133 CLT
C01717 00731 ∂29-Mar-85 0743 JJW Good news
C01718 00732 ∂29-Mar-85 0941 CLT
C01719 00733 ∂29-Mar-85 1222 RA
C01720 00734 ∂29-Mar-85 1227 VAL Circumscription Seminar
C01721 00735 ∂29-Mar-85 1234 RA your daughter Susan
C01722 00736 ∂29-Mar-85 1325 CLT
C01723 00737 ∂29-Mar-85 1428 mailer@diablo add jmc@su-ai to nail
C01724 00738 ∂29-Mar-85 1431 AAAI-OFFICE@SUMEX-AIM.ARPA Copyright Permission
C01727 00739 ∂29-Mar-85 1434 mailer@diablo add
C01728 00740 ∂29-Mar-85 1523 @SU-CSLI.ARPA:BrianSmith.pa@Xerox.ARPA Joint F1, F3, F4, C3, and Representation seminar
C01733 00741 ∂29-Mar-85 1556 ullman@diablo nail list
C01735 ENDMK
C⊗;
∂01-Jan-85 1629 ELLIOTT%SLACVM.BITNET@Berkeley BITNET mail follows
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 1 Jan 85 16:29:19 PST
Received: from ucbjade.CC.Berkeley.ARPA (ucbjade.ARPA) by UCB-VAX.ARPA (4.24/4.40)
id AA27388; Tue, 1 Jan 85 16:22:18 pst
Received: from ELLIOTT@SLACVM.BITNET
by ucbjade.CC.Berkeley.ARPA (4.19/4.31)
id AA14344; Tue, 1 Jan 85 16:30:11 pst
Message-Id: <8501020030.AA14344@ucbjade.CC.Berkeley.ARPA>
Date: 1 January 85 16:30-PST
From: ELLIOTT%SLACVM.BITNET@Berkeley
To: JMC@SU-AI
Subject: BITNET mail follows
Date: 1 January 1985, 16:21:56 PST
From: ELLIOTT at SLACVM
To: JMC at SU-AI.ARPA
Subject: Testing
I try again. Please Send me mail if I get through. The doggerel by
Glashow was kind of cute. In particular it started off with an attack
on - non other than - Burton Richter, and ended with one on our collaboration
with a number in the middle. All apparently wrong physics results, or
vassillating ones. I can see why Burt was upset; our results gave Shelly
an excuse to attack Burt, probably something he has wanted to do for
some time, by the looks of it.
Happy New Year
Elliott
∂02-Jan-85 0813 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jan 85 08:13:15 PST
Date: Wed 2 Jan 85 08:12:13-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 31 Dec 84 18:57:00-PST
It has seemed colder than usual, John. We'll report it.
Betty
-------
∂02-Jan-85 0814 BSCOTT@SU-SCORE.ARPA Re: complaint about heat withdrawn in confusion
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jan 85 08:14:21 PST
Date: Wed 2 Jan 85 08:13:21-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: complaint about heat withdrawn in confusion
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 31 Dec 84 19:18:00-PST
O.K., we won't report it for not. I know that the thermostats are not
accurate.
Betty
-------
∂02-Jan-85 0939 KUO THE PROLOG DIGEST
Dear Prof.McCarthy:
I have sent a message to restivo@SCORE last Friday asking for the Prolog
Digest, but there has been no answer yet. I am wondering if it is possible
for me to borrow your copy of the Prolog Digest. If so, please leave the copy
to Rutie. Thank you very much!
Victor
∂02-Jan-85 1000 JMC*
Ask Robert Conquest 7-1647 about Afghanistan invasion.
∂02-Jan-85 1302 RA
Inference board meeting moved from Feb. 6 to Feb 7.
∂02-Jan-85 1542 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Jan 85 15:42:10 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 2 Jan 85 15:33:57-PST
Date: Wed 2 Jan 85 15:39:47-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
Our next meeting will be at 1:15 Monday afternoon, Jan. 7, in the
Ventura conference room. Kurt Konolige will give a report on AI work
on belief revision.
-------
∂02-Jan-85 1550 RA industrial lectureships
Zohar says that some time ago you send him (and others) a message re
the above. He seemed to have erased it and needs the information. Can you
mail it to him again (or to me).
∂02-Jan-85 1608 CLT info on Elxsi via fateman
To: RPG, les-here, JMC, JJW
∂30-Dec-84 1835 fateman%ucbdali@Berkeley info on Elxsi multiprocessors..
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 30 Dec 84 18:35:42 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.40)
id AA07360; Sun, 30 Dec 84 18:28:38 pst
Received: by ucbdali.ARPA (4.24/4.40)
id AA11972; Sun, 30 Dec 84 18:34:56 pst
Date: Sun, 30 Dec 84 18:34:56 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8412310234.AA11972@ucbdali.ARPA>
To: clt@su-ai
Subject: info on Elxsi multiprocessors..
From taylor@ucbkim Sat Dec 29 21:34:48 1984
Received: from ucbkim.ARPA by ucbdali.ARPA (4.24/4.40)
id AA06331; Sat, 29 Dec 84 21:34:43 pst
Received: by ucbkim.ARPA (4.24/4.27)
id AA15492; Sat, 29 Dec 84 21:37:14 pst
Date: Sat, 29 Dec 84 21:37:14 pst
From: taylor@ucbkim (George Taylor)
Message-Id: <8412300537.AA15492@ucbkim.ARPA>
To: fateman@ucbdali, taylor@ernie
Subject: Re: Elxsi
I think that they have run a 5 CPU system. The limit is 10. I'll
ask whether they have ever built a system with more than 5.
Estimated prices:
(1) lowest price development system: $250,000 to $300,000
(2) reasonable 2 processor system: $500,000 to $600,000
(3) additional CPU's (including 8 to 16 megabytes more memory each):
about $200,000
It seems that it is fairly high priced for just fiddling around with,
but I am not sure how the performance on a uniprocessor would stakc
up against other machines. I would assume the overall speed would be
twice a Symbolics 3600 or better.
∂03-Jan-85 0001 @SU-CSLI.ARPA:YM@SU-AI.ARPA Talk on Rewrite rules at IBM San Jose.
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Jan 85 23:59:18 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 2 Jan 85 23:50:40-PST
Date: 02 Jan 85 2347 PST
From: Yoni Malachi <YM@SU-AI.ARPA>
Subject: Talk on Rewrite rules at IBM San Jose.
To: su-bboards@SU-AI.ARPA, "@DIS.DIS[1,CLT]"@SU-AI.ARPA
2:00pm Monday, Jan. 7
Room 1C-012 (in Building 28 at IBM)
Ed Wimmers
IBM Research San Jose
What does it mean for rewrite rules to be "correct"?
We consider an operational definition for FP via rewrite rules. What would it
mean for such a definition to be correct? We certainly want the rewrite rules
to capture correctly our intuitions regarding the meaning of the primitive
functions. We also want there to be enough rewrite rules to compute the correct
meaning of all expressions, but not too many, thus making equivalent two
expressions that should be different. And what does it mean for there to be
"enough" rules? We develop a new formal criterion for deciding whether there
are enough rewrite rules and show that our rewrite rules meet that criterion.
Our proof technique is novel in the way we use the semantic domain to guide an
assignment of types to the untyped language FP; this allows us to adopt powerful
techniques from the typed lambda-calculus theory.
Host: John Backus
----
If interested, come to IBM few minutes before the talk and ask for Joe Halpern
Instructions on how ot get there can be found in the IBM Calendar of events
message on this bboard.
∂03-Jan-85 0913 SMC using terminal at the house
Can you call me at Mary's if I can work on your home
terminal the morning? Theanx. By
∂03-Jan-85 1234 RA
Marc LeBrun returned your call, 494 8081
∂03-Jan-85 1321 RA
Mimi Scrandis who works with Prof. Todorovich called re setting a meeting.
Her phone: (212) 840 6595
∂03-Jan-85 1427 COTTLE@SU-SIERRA.ARPA Re: error in Karmarkar abstract
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 3 Jan 85 14:27:02 PST
Date: Thu 3 Jan 85 14:29:22-PST
From: Richard Cottle <COTTLE@SU-SIERRA.ARPA>
Subject: Re: error in Karmarkar abstract
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 3 Jan 85 11:32:00-PST
YOU'RE NOT CONFUSED. THERE IS AN ERROR IN MY VERSION OF THE ABSTRACT.
(THE FAULT IS MINE.)
CORRECTION FORTHCOMING.
-------
∂03-Jan-85 1432 COTTLE@SU-SIERRA.ARPA Re: error in Karmarkar abstract
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 3 Jan 85 14:31:53 PST
Date: Thu 3 Jan 85 14:34:14-PST
From: Richard Cottle <COTTLE@SU-SIERRA.ARPA>
Subject: Re: error in Karmarkar abstract
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 3 Jan 85 11:32:00-PST
Try this:
SPECIAL COLLOQUIUM
DEPARTMENT OF OPERATIONS RESEARCH
STANFORD UNIVERSITY
A NEW POLYNOMIAL-TIME ALGORITHM
FOR LINEAR PROGRAMMING
N. Karmarkar
AT&T Bell Laboratories
Murray Hill, New Jersey
ABSTRACT
We present a new polynomial-time algorithm for linear programming.
The running time of the algorithm is O(n↑3.5L↑2), as compared with
O(n↑6L↑2) for the ellipsoid algorithm. We prove that given a polytope
P and a strictly interior point a in P, there is a projective
transformation of the space that maps P,a to P',a' having the
following property. The ratio of the radius of the smallest sphere
with center a' containing P' to the radius of the largest sphere with
center a' contained in P' is O(n). The algorithm consists of repeated
application of such projective transformations followed by
optimization of an inscribed sphere to create a sequence of points
which converge to the optimal solution in polynomial time.
TIME: FRIDAY - JANUARY 11, 1985 - 3:15 P.M.
PLACE: TERMAN AUDITORIUM (TERMAN ENGINEERING CENTER 153)
Sorry for the confusion.
-------
∂03-Jan-85 1725 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 3 January 1985
Previous Balance 3.08
Monthly Interest at 1.5% 0.05
Current Charges 1.05 (vending machine)
-------
TOTAL AMOUNT DUE 4.18
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
Your last Pony payment was recorded on 10/13/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂03-Jan-85 1824 CS.RICH@UTEXAS-20.ARPA Re: fantasy in HCN
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 3 Jan 85 18:24:07 PST
Date: Thu 3 Jan 85 20:24:40-CST
From: Elaine Rich <CS.RICH@UTEXAS-20.ARPA>
Subject: Re: fantasy in HCN
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 25 Dec 84 12:00:00-CST
I like your message and might be willing to cosign it with you. I have
put into US mail a few pages from the November issue of the Brown Alumni
Monthly, which deal with this subject. When you get them, let me know
if you want to send something. Your letter is a lot cleverer than the
ones that appear in that issue.
Elaine
-------
∂03-Jan-85 2123 GLB
I put on your desk a copy of my file on permutations; it is almost finished
I will add some verbal explanations and comments on the problems I have found
∂03-Jan-85 2125 SMC TeX
What is the set of commands to get a display of what a file will look like printed
on a data disc?
∂03-Jan-85 2333 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Special meeting of the Seminar in Logic and Foundations of Mathematics
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 3 Jan 85 23:33:02 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 3 Jan 85 23:24:28-PST
Date: 03 Jan 85 2322 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Special meeting of the Seminar in Logic and Foundations of Mathematics
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Professor Charles Steinhorn, Vassar College
Title: Dedekind complete o-minimal structures
Place: Room 383-N, 3d Floor Lounge, Math. Dept., Stanford
Time: Monday, January 7, 4:15-5:30 P.M.
S. Feferman
∂04-Jan-85 0059 SMC TeX
I have finished "Ascribing Mental Qualities to Machines" with the exception
of two minor long lines [marked in red) and a copy of the new and old
versions is in your in-box in an interdepartmental envelope.
∂04-Jan-85 0212 SMC TeX
I have also put a copy of "Situations, Actions, and Causal Laws" in the
aforementioned envelope. Also what file area do want causal.tex put in ?
∂04-Jan-85 0229 SMC
goodnight!
∂04-Jan-85 0825 SHARON@SU-SCORE.ARPA Gianluigi Bellin
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 08:25:47 PST
Date: Fri 4 Jan 85 08:24:43-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: Gianluigi Bellin
To: McCarthy@SU-SCORE.ARPA
cc: sharon@SU-SCORE.ARPA
Gian Bellin stopped by my office yesterday and asked for a couple of things
which I need to check out with you first.
1. He said that last quarter he was an "informal" TA for CS206 (25% time)
and was not paid for this. So he said that this quarter he will be
TA'ing a course 25% time again and will need to be paid for a 50% time
appointment. Is this o.k. with you?
2. He needs a VISA extension and therefore needs a note from our department
saying that he will be supported Winter and Spring quarters. He said
that you will be supporting him at least through June 85. Is this correct;
and if so, what will he be doing (e.g. RA?).
Please let me know. Thank you, Sharon Bergman
-------
∂04-Jan-85 0910 FEIGENBAUM@SUMEX-AIM.ARPA beginning closer working relationships
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 09:10:11 PST
Date: Fri 4 Jan 85 09:11:35-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: beginning closer working relationships
To: jmc@SU-AI.ARPA
cc: nii@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA,
rpg@SU-AI.ARPA, davies@SUMEX-AIM.ARPA, rindfleisch@SUMEX-AIM.ARPA
John
from our conversations at lunch yesteday, it seems like the time is rapidly
approaching when we should integrate out parallel-LISP activities more
closely. For us, a parallel-implementation of QLAMBDA is the base-level
on which we intend to erect our experiments concerning higher-level
architectures for a highly-parallel AI machine (simulated machine, not
hardware).Such a QLAMBDA is what you're intending to do! So we need
to work together.
Our group meets at Wednesday 9:00 to 10:30. Can you make it to one of our
meetings soon (hopefully on a Wednesday that Dick Gabriel can be there
too)?
We would warmly welcome the closer collaboration.
Ed
-------
∂04-Jan-85 0924 ELLIOTT%SLACVM.BITNET@Berkeley BITNET mail follows
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 09:23:52 PST
Received: from ucbjade.CC.Berkeley.ARPA (ucbjade.ARPA) by UCB-VAX.ARPA (4.24/4.40)
id AA16675; Fri, 4 Jan 85 09:17:06 pst
Received: from ELLIOTT@SLACVM.BITNET
by ucbjade.CC.Berkeley.ARPA (4.19/4.31.1)
id AA08853; Fri, 4 Jan 85 09:24:58 pst
Message-Id: <8501041724.AA08853@ucbjade.CC.Berkeley.ARPA>
Date: 4 January 85 09:24-PST
From: ELLIOTT%SLACVM.BITNET@Berkeley
To: JMC@SU-AI
Subject: BITNET mail follows
Date: 4 January 1985, 09:22:49 PST
From: ELLIOTT at SLACVM
To: JMC at SU-AI.ARPA
Subject: We run on Sunday Morning
If it is ok with you, I will be at you house between 10 and 10:30am
this Sunday for our run.
Greetings,
Elliott
∂04-Jan-85 0936 SHARON@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 09:36:02 PST
Date: Fri 4 Jan 85 09:34:46-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 4 Jan 85 09:34:00-PST
Thanks for your reply.
Sharon Bergman
-------
∂04-Jan-85 1008 OLENDER@SU-SCORE.ARPA GENERAL FACULTY MEETING 1/8/85
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 10:08:29 PST
Date: Fri 4 Jan 85 10:05:30-PST
From: Margeret Olender <OLENDER@SU-SCORE.ARPA>
Subject: GENERAL FACULTY MEETING 1/8/85
To: Faculty@SU-SCORE.ARPA
cc: Olender@SU-SCORE.ARPA
For your review and comment, I have inserted the Tentative Agenda
for the General Faculty Meeting to he held
Tuesday, January 8, 1985
Conference Room 146
2:30pm
TENTATIVE AGENDA
FACULTY MEETING OF JANUARY 8, 1985
Conference Room 146
Margaret Jacks Hall
-1 PRESENTATION OF DEGREE CANDIDATES Victoria Cheadle
-2 REPORTS
-Computer Facilities Len Bosack
-Computer Forum Carolyn Tajnai
-Financial Betty Scott
-3 CLARIFICATION OF NEW TEACHING
REQUIREMENT FOR PHD STUDENTS Stuart Reges
-4 GABRIEL CONSULTING PROFESSORSHIP John MaCarthy
-5 PLANS FOR POSSIBLE NEW FACULTY MEMBERS Nils Nilsson
-6 OTHER BUSINESS
-------
∂04-Jan-85 1052 CLT meeting on parallel lisps
To: fateman@UCB-VAX.ARPA, JMC@SU-AI.ARPA, RPG@SU-AI.ARPA
∂03-Jan-85 1403 fateman%ucbdali@Berkeley meeting on parallel lisps
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 3 Jan 85 14:03:07 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.40)
id AA00335; Thu, 3 Jan 85 13:56:15 pst
Received: by ucbdali.ARPA (4.24/4.40)
id AA09015; Thu, 3 Jan 85 14:03:04 pst
Date: Thu, 3 Jan 85 14:03:04 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8501032203.AA09015@ucbdali.ARPA>
To: hilfingr%renoir@Berkeley, larus%kim@Berkeley, taylor%kim@Berkeley
Subject: meeting on parallel lisps
Cc: clt@su-ai, fateman%ucbdali@Berkeley, rpg@su-ai
It looks like we have a quorum here at UCB for the Jan. 9 meeting;
I believe the tentative plans were for an afternoon meeting perhaps
stretching to dinner. Carolyn & Dick : how does that sound?
-- RJF
---------------------------------
Sounds fine to me.
John would like to make some introductory remarks
about the project in general.
I think RPG will talk about QLAMBDA (eh, rpg?)
What else?
∂04-Jan-85 1119 RA
The books you wanted are on your desk.
∂04-Jan-85 1249 RA
Please call Ed Fredkin (617) 239 0444
∂04-Jan-85 1414 RA
When you come in try to call Ed Feigenbaum @ Nil Nilson office 7-9745.
∂04-Jan-85 1439 EENGELMORE@SUMEX-AIM.ARPA MCC Industrial Affiliates Program
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 14:39:18 PST
Date: Fri 4 Jan 85 14:39:59-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: MCC Industrial Affiliates Program
To: Lundstrom@SU-SIERRA.ARPA, JMC@SU-AI.ARPA, Ullman@SU-SCORE.ARPA,
CRC.EJM@SU-SIERRA.ARPA, Buchanan@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA
cc: Feigenbaum@SUMEX-AIM.ARPA, EENGELMORE@SUMEX-AIM.ARPA
Your name was listed among those to whom copies of a letter written to
President Donald Kennedy by Bobby Inman were sent last month. The
letter describes the MCC University Affiliates Program and invites
Stanford's participation.
Ed Feigenbaum thinks that joining the MCC program would be very
advantageous to Stanford and will be contacting President Kennedy's
office early next week to encourage that decision. If YOU want
to join Ed in support of this, please let him know.
(If YOUR copy of the letter has sunk into the sea of papers in which we
all swim and you would like yet ANOTHER copy of the information about
the MCC University Affiliates Program, please let me know.)
-------
∂04-Jan-85 1517 ARIADNE@SU-SCORE.ARPA CSD colloquium
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 15:17:33 PST
Date: Fri 4 Jan 85 15:03:54-PST
From: Ariadne Johnson <ARIADNE@SU-SCORE.ARPA>
Subject: CSD colloquium
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Stanford-Phone: (415) 497-0872
CS 300 -- Computer Science Department Colloquium -- Winter 1984-1985.
We have scoured the world for an exiting list of speakers for the colloquium
this coming quarter. For the first meeting on
Tuesday, January 8, 1985
at 4:15 in Terman Auditorium
we are pleased to bring you, complete with video demonstrations:
TECHNIQUES FOR ALGORITHM ANIMATION
by Marc H. Brown (himself)
from Brown University
Abstract:
Since the Fall of 1983, researchers at Brown University have been routinely
"animating" algorithms to gain better better insight into their operation.
Interacting with multiple dynamic (real-time) displays of programs and
associated data structures in a personal workstation environment has proven
to be quite affective in a number of contexts. It has been used as the
primary mode of communication for teaching courses on introductory programming
and algorithms and data structures; it has been an important aid in the
design and analysis of several advanced algorithms; and it has the potential
to be a vital component in software engineering environments.
This talk will present an overview of our conceptual framework for the process
of animating algorithms, and discuss a number of instructional and research
applications in detail.
Following the talk, there will be a Mac "hands-on" session.
***
Come all on Tuesday the 8th, and don't forget the cookies before
in the MJH lounge, at 3:45.
***
Please note the following schedule for future speakers:
CS300 - Computer Science Department Colloquium -- Tuesdays 4:15 in Terman Aud.
Date Speaker of Place on Topic
----- ------------------------------------------------------------------
8Jan Marc BROWN of Brown University on Visual Algorithm Development
15Jan Niklaus WIRTH of the ETH in Zurich on Programming Languages
22Jan Hassan AIT-KACI of MCC on Type Subsumption -- and a bit on MCC itself
29Jan Charles LEISERSON of MIT on The Connection Machine Architecture
5Feb Alvin DESPAIN of UC Berkeley on their Prolog Machine
12Feb to be confirmed
19Feb James BROWNE of the University of Texas in Austin on Parallel
Computation Structures
26Feb Robert BALZER of the Information Sciences Institute of USC on Modern
Integrated Software Development Environments
5Mar Nils NILSSON, now of Stanford CSD -- topic to be confirmed
12Mar Hank KORTH of the University of Texas in Austin on
Non-First-Normal-Form Relations
19Mar Rob KLING of UC Irvine on Social Effects of Computing
----------------------------------------------------------------------------
-------
∂04-Jan-85 1654 NILSSON@SU-SCORE.ARPA Re: MCC Industrial Affiliates Program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 16:53:53 PST
Date: Fri 4 Jan 85 16:50:44-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: MCC Industrial Affiliates Program
To: EENGELMORE@SUMEX-AIM.ARPA
cc: Lundstrom@SU-SIERRA.ARPA, JMC@SU-AI.ARPA, Ullman@SU-SCORE.ARPA,
CRC.EJM@SU-SIERRA.ARPA, Buchanan@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA, NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>" of Fri 4 Jan 85 14:38:46-PST
I'd like to hear Ed's reasons why he thinks joining an MCC affiliates
program is a good idea. I'd also like to hear why anyone might
think it is a bad idea.
(I'm starting out rather sceptical about it.) -Nils
-------
∂04-Jan-85 1708 RPG
∂28-Dec-84 1233 JMC "after I showed him the recent mail ..."
Why did you say "after I showed him the recent mail ..."? You didn't
show it to me. I have been skimming the Common Lisp Digest right along,
even though this is the first time I have felt impelled to comment.
I could explore AAAI's interest with Woody or the Council, but I am
quite certain that the quinquevirate will not save itself work by
getting an outside sponsor. It just means that everything will
have to be explained twice and then checked to make sure AAAI or
whoever got it right.
Hm, I had forgotten that I had been forwarding these `private' messages
to the CL repository, and I assumed that when you sent the reply to me,
that I had somehow shown it to you, either directly or by you seeing it in
my mail file. It was that latter possibility that I wanted to `cover up.'
-rpg-
∂04-Jan-85 1725 EENGELMORE@SUMEX-AIM.ARPA Erratum
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 17:25:44 PST
Date: Fri 4 Jan 85 17:27:03-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: Erratum
To: Lundstrom@SU-SIERRA.ARPA, JMC@SU-AI.ARPA, Ullman@SU-SCORE.ARPA,
CRC.EJM@SU-SIERRA.ARPA, Buchanan@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA
cc: Feigenbaum@SUMEX-AIM.ARPA
Not paying attention means ALWAYS having to say you're sorry...The header
for the msg about MCC SHOULD have been "MCC UNIVERSITY Affiliates Program.
Sorry,
Ellie
-------
∂04-Jan-85 1755 FEIGENBAUM@SUMEX-AIM.ARPA Re: MCC Industrial Affiliates Program
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 17:55:08 PST
Date: Fri 4 Jan 85 17:54:46-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: MCC Industrial Affiliates Program
To: NILSSON@SU-SCORE.ARPA, EENGELMORE@SUMEX-AIM.ARPA
cc: Lundstrom@SU-SIERRA.ARPA, JMC@SU-AI.ARPA, Ullman@SU-SCORE.ARPA,
CRC.EJM@SU-SIERRA.ARPA, Buchanan@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA
In-Reply-To: Message from "Nils Nilsson <NILSSON@SU-SCORE.ARPA>" of Fri 4 Jan 85 16:54:50-PST
Reasons:
a. MCC is going to be a major center of research for many important
topics in computer science research and computer technology. It's
good to find out directly from them what they're doing.
b. It will be good to be in a position to influence their directions and
problems somewhat. They will need help of this sort.
c. all of this does not cost us anything (I think) except the time to
go there. If I'm wrong about this, let me know.
Ed
-------
∂05-Jan-85 1255 CLT arpa paragraph(s)
see 84arpa[1,clt]
it is completely de-texified,
i can prune or expand it more if it seems unsuitable
∂05-Jan-85 1552 RINDFLEISCH@SUMEX-AIM.ARPA Re: MCC Industrial Affiliates Program
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Jan 85 15:52:34 PST
Date: Sat 5 Jan 85 14:39:29-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Re: MCC University Affiliates Program
To: EENGELMORE@SUMEX-AIM.ARPA, Lundstrom@SU-SIERRA.ARPA, JMC@SU-AI.ARPA,
Ullman@SU-SCORE.ARPA, CRC.EJM@SU-SIERRA.ARPA, Buchanan@SUMEX-AIM.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Genesereth@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA,
HK.PLD@FORSYTHE
cc: Feigenbaum@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA
Kennedy has asked Jerry Lieberman's office to formulate a Stanford position on
the MCC Affiliates proposal and Pat Devaney is collecting inputs. So your
positions should be sent to Pat, which can be done by electronic mail to
HK.PLD@Forsythe.
Tom R.
-------
∂05-Jan-85 1827 NILSSON@SU-SCORE.ARPA Re: radical computing
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jan 85 18:27:22 PST
Date: Sat 5 Jan 85 18:24:34-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: radical computing
To: JMC@SU-AI.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 5 Jan 85 18:21:00-PST
I think they knew a bit about MACSYMA, and I'm sure they knew about LISP.
(I was invited down to San Diego one day--by a member of their panel, Saul
Amarel--to talk about AI and expert systems.)
-------
∂05-Jan-85 2322 SMC TeX
first.tex is nearly done, but it uses two symbols not
available in tex.One is what ought to be
squaresubset and the other is
the same thing opening in the other
direction. Can these be replaced by any other symbol?
∂06-Jan-85 0426 GROSOF@SU-SCORE.ARPA GOETZ AND PERSONALLY DEALING WITH REAL VIOLENCE- A NY'er's CREED
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Jan 85 04:26:17 PST
Date: Sun 6 Jan 85 04:25:13-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: GOETZ AND PERSONALLY DEALING WITH REAL VIOLENCE- A NY'er's CREED
To: bboard@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA
As a born and bred New Yorker with extensive experience riding the
subways not to mention walking/ running the streets I feel qualified
to "vote" on the Goetz shooting incident. As far as I can make out
from the facts, he judged the punks not in some merely intellectual or
moral fashion, but as worthy of execution at best, revenge murder at
worst. This is COMPLETELY UNACCEPTABLE even if understandable in
terms of Goetz' rage or frustration with imperfect social justice.
I have personally been threatened, accosted, and robbed of $5-type
amounts three or four times, all while age 9-14, by youths. I was
afraid. I am often afraid and wary and cautious in New York and in
some other places, e.g. deserted or bad sections of major cities. But
avoidance, prosecution, even (!) human forgiveness are appropriate
answers not revenge murder or execution.
REAL-LIFE SELF DEFENSE IS ALMOST ALWAYS AVOIDANCE
The main answer to personal
safety is intelligent assessment and avoidance of risks, just as in
for example (!) driving around the Bay Area. There are hazards in
life. Immunity to them is not some God-given "right" which confers
absolution on any method of response. Physical resistance is not "the"
morally correct answer, even when not murderous. It has risks, not
only for the defender's person, but for excessive degree of injury to
the threatener or to innocent third parties. And for what reward
besides the money not lost? Satisfactions of revenge, which is not a
very laudable one in my values, and increasing the chance of the threatener's
prosecution by the law, which, face it, is a hassle as well as very
uncertain. Not worth it to ME for $5 or even $500, the largest amount
approximately I am likely ever to be robbed of.
WHEN IS IT WORTH IT TO PHYSICALLY RESIST ROBBERY
Perhaps if I was a martial arts expert...
but I'm not. Using a weapon runs two risks: provoking escalation from the
attacker (and perhaps having them turn the weapon against the victim, which
occurs VERY commonly with non-experts in self-defense); committing
manslaughter, which I take seriously as a moral catastrophe if at all
avoidable.
In this world, in the street, in the
subway, in fact everywhere, people do not physically fight fair unless it
is a game. Violent people are VICIOUS, almost always have actual experience
of SERIOUS fighting and moreover, overreact. All my experience,
direct and by report, has taught me that physical resistance is almost never
worth it unless there is TRULY NO alternative. Two blocks from my home in NY
occurred the recent incident of a young woman being killed because she
attempted to resist handing over $12 and submitting to being raped.
Her dying words (she was lucid to the end in the hospital) were that she
shouldn't have resisted, it WASN'T WORTH IT. To make physical resistance
worth it when there is no immediate threat of severe injury or death
requires either a great valuation of a certain kind of pride ("no one takes MY
money"; "no one can hurt me!") which flies in the face of the simple fact
of vulnerability as a human being; or else EXPERTISE in physical resistance,
and appropriate weapons carried at all times. In my opinion, the notion
(fostered by the barrage of fiction and fantasy and sensationalism about
violence that we are all subjected to in our culture) that one "ought" to
resist (always) is dangerous crap. It's not a question of cowardice or
courage; it's a question of rational policy in a world full of dangers.
Some argue that people robbed are sometimes randomly murdered too so it is
better to resist right away, just in case. My response is that random
murder, and random death are omnipresent and our vulnerability to them
is unaffected by such a policy.
AVOIDING VIOLENT CONFRONTATION IN GENERAL IS A SKILL AND A DUTY
In the few times I have been seriously physically threatened in New York,
it had nothing to do with money. My main fear besides for my own
person in retrospect was (potentially) overreacting, and seriously
hurting the other in a situation where avoidance was possible. Yes,
is it too out of fashion not to want to hurt an attacker? (And I
don't mean out of fear of the law.) Since age 14 I haven't even come
close to being mugged or accosted, mainly because of a good sense of
where to be and how to project psychologically. The most dangerous
thing to do in violent places is to convey fear on the one hand, or else
pride/arrogance/challenge/rude interest. Emotional neutrality and
translucence is what defuses and avoids triggering violent people over
the edge. Most people who haven't lived in a place with the sensible
tension of potential threat and violence do not understand this properly.
Native New Yorkers and others, e.g. ghetto dwellers around the world,
know that "street sense", "street face", etc. are essential life skills
which reduce the risks of being accosted or attacked to reasonable
levels. The actual chance of a non-ghetto-dweller in NY being hurt or
even robbed of a significant amount of money are really quite low.
The density of the city and the exposure to people who are predatory or
unstable are what give the sense of potential events.
WHY GOETZ IS HAILED
Goetz receives applause in great if not most part because his attempt
at multiple murder acts as a deterring disincentive for petty
intimidators. It's in the selfish interest of people to raise the
risk of the muggers/ robbers. But like many extremists who are useful
in conflict, even if unacceptable as a general model for belief and
behavior, his example must be rejected and condemned on grounds of
wisdom and morality in a humanist democratic society built on laws not
revenge or vigilantism.
-------
∂06-Jan-85 1431 VAL Extended abstract of my two papers on circumscription
I left a copy in your mailbox.
∂07-Jan-85 0911 SHORTLIFFE@SUMEX-AIM.ARPA MCC University Affiliates Program
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 09:10:59 PST
Date: Mon 7 Jan 85 09:12:09-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: MCC University Affiliates Program
To: hk.pld@SU-FORSYTHE.ARPA
cc: EENGELMORE@SUMEX-AIM.ARPA, Lundstrom@SU-SIERRA.ARPA, JMC@SU-AI.ARPA,
Ullman@SU-SCORE.ARPA, CRC.EJM@SU-SIERRA.ARPA, Buchanan@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA,
Feigenbaum@SUMEX-AIM.ARPA, RINDFLEISCH@SUMEX-AIM.ARPA
In-Reply-To: Message from "T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>" of Sat 5 Jan 85 14:39:33-PST
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
I'd like to express my support for Stanford's participation in the
MCC University Affiliates Program since I understand that you are gathering
information to help define the Stanford position. The rationale is simple:
(a) MCC is attracting some extremely good people, and it is wise for us to
maintain knowledge of what they are up to; (b) there seems to be minimal cost
to the University, particularly since it is likely that many of the faculty
would occasionally be making trips to MCC and UT Austin anyway; and (c) our
involvement may allow us to influence the decisions they make about research
directions and resource allocation.
Regards,
Ted Shortliffe
School of Medicine (Department of Medicine)
-------
∂07-Jan-85 1016 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 10:16:47 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 7 Jan 85 10:16:34-PST
Date: Mon 7 Jan 85 10:16:45-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting reminder
To: f4@SU-CSLI.ARPA
!
---------------
Return-Path: <@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA>
Received: from SU-SCORE.ARPA by SRI-AI.ARPA with TCP; Wed 2 Jan 85 15:40:44-PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Wed 2 Jan 85 15:40:20-PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 2 Jan 85 15:33:57-PST
Date: Wed 2 Jan 85 15:39:47-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
Our next meeting will be at 1:15 Monday afternoon, Jan. 7, in the
Ventura conference room. Kurt Konolige will give a report on AI work
on belief revision.
-------
-------
∂07-Jan-85 1104 RPG Sequent
To: JJW@SU-AI.ARPA, JMC@SU-AI.ARPA, CLT@SU-AI.ARPA, LES@SU-AI.ARPA
They will arrive at 3:15 or so to meet with us. Dave Rogers, the designer,
will be there. I will arrive around 2, I think, and I will have some of their
documentation with me for CLT and Joe to look at. They will be trying to
locate office 360 (my old one).
-rpg-
∂07-Jan-85 1143 AAAI@SRI-AI.ARPA Rebate policy
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 11:42:55 PST
Date: Mon 7 Jan 85 11:38:53-PST
From: name AAAI-OFFICE <AAAI@SRI-AI.ARPA>
Subject: Rebate policy
To: JMC@SU-AI.ARPA
cc: aaai@SRI-AI.ARPA, Doyle@CMU-CS-A.ARPA, Fikes%usc-ecld@USC-ECL.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I've talked to Jon Doyle and Richard about the rebate from the
workshop. Everyone agrees this is a problem, and some policy should be
established. Richard and I thought that since you are the chair of the
WOrkshop Program you might want to suggest a policy about rebates to
Woody. In fact, if there are other issues about the management of the
workshops that should be addresses now, maybe should try to develop
additional policies. What do you think?
- Claudia
-------
∂07-Jan-85 1200 JMC*
copies of reviews to Nils
∂07-Jan-85 1216 GREEP@SU-CSLI.ARPA Michael Kohlhaas
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 12:16:37 PST
Date: Mon 7 Jan 85 12:16:56-PST
From: Steven Tepper <greep@SU-CSLI.ARPA>
Subject: Michael Kohlhaas
To: su-bboards@SU-CSLI.ARPA
cc: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 7 Jan 85 00:50:00-PST
Kleist's story is "Michael Kohlhaas" (not Kohlhaus). For anyone who wants
to read about vigilantism on a grand scale (basically he turns a whole town
into his followers), I recommend it.
-------
∂07-Jan-85 1311 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Course announcement update
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 13:09:29 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 7 Jan 85 13:07:39-PST
Date: 07 Jan 85 1252 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Course announcement update
To: su-bboards@SU-AI.ARPA, "@DIS.DIS[1,CLT]"@SU-AI.ARPA
This is an update about the course to be taught by P. Aczel
(visiting CSLI from U. of Manchester.) The course is scheduled to
meet Fridays 1:15-3:00 in 381-T (math corner).
-----------------------------------------------------------------------------
SETS AND PROCESSES
------------------
MATH 294 (PHIL 394) WINTER QUARTER.
COURSE ANOUNCEMENT
provisional time: Fridays, 1.15---3.15.
The standard universe of well-founded sets can be completed in a
natural way so as to incorporate every possible non-well-founded set.
The new completed universe will still model all the axioms of set
theory except that the foundation axiom must be replaced by an
anti-foundation axiom. The first part of the course will be concerned
with this new axiom, its model and its consequences. Several
interesting variants of the axiom will also be examined.
The second part of the course will be concerned with an axiomatic
approach to a general notion of abstract sequential process. These
processes are capable of interacting with each other so that a variety
of operations for their parallel composition will be available. The
notion is intended to form the foundation for an approach to the
semantics of programming languages involving concurrency. A model for
the axiom system can be extracted from recent work of Robin Milner.
But by using the anti- foundation axiom a simple purely set theoretic
model will be given.
Some familiarity with the axiomatic theory of sets and classes will be
presupposed. An understanding of the notion of a class model of ZFC
will be needed. Definition by recursion on a well-founded relation
and Mostowski's collapsing lemma will be relevent. But topics such as
the constructible universe, forcing or large cardinals will NOT be
needed. Some familiarity with computation theory would be useful.
Underlying the model constructions in both parts of the course is a
general result whose apreciation will require some familiarity with
the elements of universal algebra and category theory.
Background references will be available at the start of the course.
Auditors are very welcome. The course may be of interest to both
mathematicians and computer scientists.
PETER ACZEL
∂07-Jan-85 1353 MOGUL@SU-SCORE.ARPA Re: Michael Kohlhaas
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 13:53:24 PST
Date: Mon 7 Jan 85 13:46:22-PST
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: Re: Michael Kohlhaas
To: greep@SU-CSLI.ARPA, su-bboards@SU-CSLI.ARPA
cc: JMC@SU-AI.ARPA
In-Reply-To: Message from "Steven Tepper <greep@SU-CSLI.ARPA>" of Mon 7 Jan 85 12:15:52-PST
Kleist's story is a good one; good enough that E. L. Doctorow recycled
it for "Ragtime" (does the name Coalhouse Walker, Jr. ring a bell?)
I've nothing against recycling, by the way: "King Lear" is not the
first telling of its tale, either.
-------
∂07-Jan-85 1358 GLB
hi
I missed you today, Monday 17 at 14:00, when I came in to take the CS206
exam. Therefore I still need to make it up. Please contact me at your
leisure to reschedule. Thursdays and Fridays are in general better than
Mondays and Tuesdays for me. I am at gefell@navajo or 408-725-8111 x3428.
Thanks. Tom Gefell.
∂07-Jan-85 1716 OLENDER@SU-SCORE.ARPA FACULTY LUNCH
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 17:15:56 PST
Date: Mon 7 Jan 85 17:12:15-PST
From: Margeret Olender <OLENDER@SU-SCORE.ARPA>
Subject: FACULTY LUNCH
To: Faculty@SU-SCORE.ARPA
cc: Olender@SU-SCORE.ARPA
Nils Nilsson is continuing the traditional Computer Science Department
"Tuesday Faculty Lunch." Don't miss tomorrow's --
Tuesday, January 8, 1985
Conference Room 146
12:15pm
margaret
-------
∂07-Jan-85 1825 AAAI-OFFICE@SUMEX-AIM.ARPA Conference and Workshop policies and procedures
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 18:25:35 PST
Date: Mon 7 Jan 85 18:26:52-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Conference and Workshop policies and procedures
To: Brachman@SRI-KL.ARPA, Tenenbaum@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Recently, it has come to my attention that we need to start to think
about the development of specific policies and procedures about all
phases of conference and workshop management (e.g reimbursement of
expenses, criteria used for the selection of NCAI conference sites,
conferences out of the U.S.). I guess I'd like to see us not be in a
position where we just react to some issue, but have anticipate issues
and have in situ policies and procedures.
I'd like to suggest we hold a meeting of the conference and workshop
committees in February in our offices to discuss the specific issues
(I've already several issues to discuss). If you agree with my
comments, I'd like to know when would be the best time to meet in
February.
I look forward to hearing from you!
Cheers,
Claudia
-------
∂07-Jan-85 1835 NILSSON@SU-SCORE.ARPA CS 224
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 18:35:00 PST
Date: Mon 7 Jan 85 18:33:53-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: CS 224
To: jmc@SU-AI.ARPA, tw@SU-AI.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
Buchanan@SUMEX-AIM.ARPA, Binford@SU-AI.ARPA, Genesereth@SUMEX-AIM.ARPA
cc: Nilsson@SU-SCORE.ARPA
Since Doug Lenat is not here this year, he won't be teaching CS224 (the
AI guest-lecture course) in the Spring. I would be glad to volunteer
to do it and to put together a tentative list of topics and speakers.
Ed Feigenbaum made an interesting suggestion: give the course one
evening a week thus making it convenient for guest lecturers and non-Stanford
people to attend. Probably it ought to be only a 1 unit (credit/no credit)
course. I will assume that no answer to this msg is a ringing endorsement
of this plan. Please do send any suggestions you have for "must" lecturers,
and please do volunteer to give one of the lectures if you are so
inclined. -Nils
-------
∂07-Jan-85 2049 BUCHANAN@SUMEX-AIM.ARPA Re: CS 224
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 20:49:36 PST
Date: Mon 7 Jan 85 20:50:25-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Re: CS 224
To: NILSSON@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, tw@SU-AI.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
Binford@SU-AI.ARPA, Genesereth@SUMEX-AIM.ARPA
In-Reply-To: Message from "Nils Nilsson <NILSSON@SU-SCORE.ARPA>" of Mon 7 Jan 85 18:37:19-PST
As a matter of policy, I object to evening and weekend classes -- for the
students as well as for those of us who answer phones and talk to students
all day. However, I'd volunteer to give a lecture if you want one on
machine learning or expert systems or chemistry or medical applications.
bgb
p.s. When I ran an evening seminar a few years ago, the one or two women
who came objected strongly to coming to campus after dark. Things have
gotten a little safer since then, I think, but you might have your
secretary poll the women in the CSD to see what they think.
-------
∂08-Jan-85 0914 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 09:14:14 PST
Date: Tue 8 Jan 85 09:11:34-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: : ;
Data Structures and Algorithms: by Kurt Mehlhorn
Volume 1-Sorting and Searching (8412784)
Volume 2-Graph Algorithms and NP-Completeness (8412783)
Volume 3-Multi-dimensional Searching and Computational Geometry (8412782)
Natural Language Communication with Pictorial Information Systems ed. by Bolc
P98.N29 1984
First European Simulation Congress ESC 83 ed. by Ameling QA76.9C65E96 1983 c.2
Methods and Applications of Error-Free Computation by Gregory and Krishnamurthy
QA297.5.G735 1984
Ada Concurrent Programming by Gehani QA76.73.A35G433 1984
PISA A Programming System for Interactive Production of Application Software
by Marty QA76.6M3616
LAN Components User's Manual Intel March 1984 TK5105.5I5
Image Sequence Analysis ed. by Huang TA1632I483 c.2
La Conception Des Systemes Repartis. Cours de la Commission des Communautes
Europeennes. QA76.9.D5C66
Computer Modeling For Business and Industry by Bowerman and O'Connell
HF1017.B655 1984
SNA Theory and Practice by Guruge TK5105.5G87 1984
H. Llull
-------
∂08-Jan-85 0958 RA
Lynn Scarlet called (805) 963 5993 re book review proposal that you made.
∂08-Jan-85 1022 GREEP@SU-CSLI.ARPA Re: Michael Kohlhaas
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 10:22:10 PST
Date: Tue 8 Jan 85 10:21:07-PST
From: Steven Tepper <greep@SU-CSLI.ARPA>
Subject: Re: Michael Kohlhaas
To: MOGUL@SU-SCORE.ARPA
cc: JMC@SU-AI.ARPA
In-Reply-To: Message from "Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>" of Mon 7 Jan 85 14:09:20-PST
Actually Kleist himself recycled the story from an earlier tale.
-------
∂08-Jan-85 1026 RA
1. Dick Jenks (914) 945 1233 called re Computer Algebra Conference for 1986
2. Reminder: you have a dental appointment tomorrow @ 2:45 (Dr. Bartlet)
3. What kind of work does Sara do for you. She put the wrong account number
on her time sheet. Do you want her on any particular account?
∂08-Jan-85 1058 TAJNAI@SU-SCORE.ARPA Arno Penzias
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 10:58:49 PST
Date: Tue 8 Jan 85 10:33:30-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Arno Penzias
To: faculty@SU-SCORE.ARPA
Dr. Arno Penzias will be our guest speaker at the Forum banquet,
Wednesday, 13 Feb. I plan to make arrangements for a limousine to
meet him around noon that day at SFO and to return him to SFO around
noon on Thursday.
However, if any of you know him personally and would like to do the
honors, it would be a friendly gesture.
Please let me know.
Carolyn
-------
∂08-Jan-85 1136 TW 224
To: nilsson@SU-SCORE.ARPA
CC: TW@SU-AI.ARPA, JMC@SU-AI.ARPA, TOB@SU-AI.ARPA,
feigenbaum@SU-SCORE.ARPA, buchanan@SU-SCORE.ARPA,
genesereth@SU-SCORE.ARPA
Nils,
Your note about CS224 is exactly in accord with the discussion we had
in the Masters committee meeting yesterday, in which we decided to treat
224 as a seminar rather than a regular course requirment. Most of
the other seminars are 1 unit. Sounds fine. I would be glad to give
a lecture, although evenings are less convenient for me. --t
∂08-Jan-85 1634 SMC scribe
I have done very little in scribe, but what I did do seemed very easy and
straight-forward. What do you think I should do? How much would I need
to know to apply for a job asking for "scribe wizards"?
∂08-Jan-85 1643 OLENDER@SU-SCORE.ARPA FULL FAULTY MEETING TODAY
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 16:43:45 PST
Date: Tue 8 Jan 85 13:04:48-PST
From: Margeret Olender <OLENDER@SU-SCORE.ARPA>
Subject: FULL FAULTY MEETING TODAY
To: Faculty@SU-SCORE.ARPA
cc: Olender@SU-SCORE.ARPA
The quarterly faculty meeting will be held today (Jan 8) in
Conference Room 146
2:30pm
margaret
-------
∂08-Jan-85 1708 RPG Re: Tomorrow
To: fateman%ucbdali@UCB-VAX.ARPA
CC: CLT@SU-AI.ARPA, JMC@SU-AI.ARPA
∂08-Jan-85 1655 fateman%ucbdali@Berkeley Re: Tomorrow
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 16:54:56 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.40)
id AA28312; Tue, 8 Jan 85 13:01:21 pst
Received: by ucbdali.ARPA (4.24/4.40)
id AA22137; Tue, 8 Jan 85 13:08:38 pst
Date: Tue, 8 Jan 85 13:08:38 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8501082108.AA22137@ucbdali.ARPA>
To: RPG@SU-AI.ARPA
Subject: Re: Tomorrow
I don't recall a particular time being set; 1:00 or perhaps a bit later
would be fine with me. What is convenient with Carolyn & John?
We all planned to leave Stanford at noon. So 1:00-1:30 is a reasonable time
to meet at your office, which I assume is still in that science building.
-rpg-
∂08-Jan-85 2008 @SU-SCORE.ARPA:lantz@Pescadero Kodak visitors
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 20:08:11 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Tue 8 Jan 85 17:21:51-PST
From: Keith Lantz <lantz@Pescadero>
Date: 8 Jan 1985 1720-PST (Tuesday)
To: faculty@score, csl-faculty@sierra
Cc: ross@score
Subject: Kodak visitors
Three Forum visitors from Kodak will be at Stanford the morning of the
18th. They are members of a newly formed corporate function for
long-term planning and include:
Henry Pfendt, General Director
Mike Cowley, Director -- long-range automation
Bob Fisher, Director -- communications technology
Perhaps they had something to do with the recent purchase of 7% of Sun
Microsystems. In any event, they would like to talk with interested
parties about "information systems architecture, networks, artificial
intelligence and manufacturing systems". They are available from 9 to
12. If anyone is interested and/or willing to talk with them, please
contact Valerie Ross (ross@score).
∂08-Jan-85 2038 RESTIVO@SU-SCORE.ARPA Re: for inclusion in Prolog Digest
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 20:37:58 PST
Date: Tue 8 Jan 85 19:17:51-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: Re: for inclusion in Prolog Digest
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 28 Dec 84 12:23:00-PST
[cwr] I would be interested in seeing the formalizations of knowledge
and Ma's FOL axiomatization.
-------
∂08-Jan-85 2233 @SU-SCORE.ARPA:baskett@decwrl.ARPA the Computer X undergraduate program at Stanford
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 22:33:02 PST
Received: from decwrl.ARPA by SU-SCORE.ARPA with TCP; Tue 8 Jan 85 22:30:25-PST
Received: from saturn.ARPA by decwrl.ARPA (4.22.01/4.7.34)
id AA11196; Tue, 8 Jan 85 22:32:23 pst
Received: by saturn.ARPA (4.22.01/4.7.34)
id AA06240; Tue, 8 Jan 85 22:32:16 pst
From: baskett@decwrl.ARPA (Forest Baskett)
Message-Id: <8501090632.AA06240@saturn.ARPA>
Date: 8 Jan 1985 2232-PST (Tuesday)
To: faculty@su-score
Subject: the Computer X undergraduate program at Stanford
My knowledge of Stanford as a whole is at least as imperfect as anyone
else's but I do believe that an undergraduate program in Computer X is
likely to exist soon. So the discussion at today's faculty lunch where
the question was more about whether there should be an undergraduate
program in Computer X seemed to me to be beside the point. The point I
would like the faculty to consider is whether and to what extent the CS
faculty would like to participate in the undergraduate program in
Computer X at Stanford. My belief is that a large fraction of the
faculty at Stanford as a whole has accepted the view that computing of
one kind or another is, or is going to be, a significant part of THEIR
future and certainly a part of the professional lives of their students
and their children. Thus knowledge of computing is approaching the
importance of knowledge of mathematics or knowledge of physics in the
minds of this large fraction. I believe that the current administration
is part of this fraction and that it will act on this view by establishing
an undergraduate program in knowledge of computing or Computer X
soon. My concern is that the CS faculty will be discussing "whether"
while the rest of the Stanford faculty discusses "how". I think it
would be a tragedy for both the department and the university if it
happened that way.
Forest
∂08-Jan-85 2240 WIEDERHOLD@SU-SCORE.ARPA CS Colloquium - June 15, Prof. WIRTH on MODULA II compilers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 22:39:25 PST
Date: Tue 8 Jan 85 22:31:00-PST
From: Gio Wiederhold <WIEDERHOLD@SU-SCORE.ARPA>
Subject: CS Colloquium - June 15, Prof. WIRTH on MODULA II compilers
To: ALL-COLLOQ@SU-SCORE.ARPA, SU-BBOARDS@SU-SCORE.ARPA, TULEY@SU-SCORE.ARPA,
FACULTY@SU-SCORE.ARPA, MILTON@SRI-AI.ARPA
CS 300 -- Computer Science Department Colloquium -- Winter 1984-1985.
Our second meeting will be:
Tuesday, January 15, 1985
at 4:15 in Terman Auditorium
Professor Niklaus WIRTH
Recpient of the 1985 ACM Turing Award,
ETH, Zurich, visiting XEROX Palo Alto Research Laboratories
A FAST COMPILER FOR MODULA-2
One-pass compilation has the advantage of being considerably faster
than many-pass compilation, because it avoids the generation, storage,
retrieval, and analysis of interpass codes. On the other hand, it
requires a relatively large main store. Since nowadays even "small"
computers tend to have a considerable amount of memory, one-pass
compilers regain significance.
We compare a new Modula-2 compiler with existing ones and describe
its main structure. In particular, also some problems and their
solution connected with separate compilation are discussed.
Cookies prior to the seminar at 3:45 in the MJH Lounge. See you all!
-------
∂08-Jan-85 2251 WIEDERHOLD@SU-SCORE.ARPA OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 22:51:36 PST
Date: Tue 8 Jan 85 22:34:55-PST
From: Gio Wiederhold <WIEDERHOLD@SU-SCORE.ARPA>
Subject: OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
To: ALL-COLLOQ@SU-SCORE.ARPA, SU-BBOARDS@SU-SCORE.ARPA, TULEY@SU-SCORE.ARPA,
FACULTY@SU-SCORE.ARPA, MILTON@SRI-AI.ARPA
SPECIAL COLLOQUIUM
Department of Operations Research, Stanford University
A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING
N. Karmarkar
AT&T Bell Laboratories, Murray Hill, New Jersey
ABSTRACT
We present a new polynomial-time algorithm for linear programming.
The running time of the algorithm is O(n↑3.5L↑2), as compared with
O(n↑6L↑2) for the ellipsoid algorithm. We prove that given a polytope
P and a strictly interior point a in P, there is a projective
transformation of the space that maps P,a to P',a' having the
following property. The ratio of the radius of the smallest sphere
with center a' contained in P' to the radius of the largest sphere
with center a' contained in P' is O(n). The algorithm consists of
repeated application of such projective transformations followed by
optimization of an inscribed sphere to create a sequence of points
which converge to the optimal solution in polynomial time.
TIME: FRIDAY - JANUARY 11, 1985 - 3:15 P.M.
PLACE: TERMAN AUDITORIUM (TERMAN ENGINEERING CENTER 153)
-------
∂08-Jan-85 2349 WIEDERHOLD@SUMEX-AIM.ARPA re: OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 8 Jan 85 23:49:04 PST
Date: Tue 8 Jan 85 23:47:58-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: re: OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
To: JMC@SU-AI.ARPA
cc: "*PS:<WIEDERHOLD>CS300.MSGS-1Q85.2"@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 8 Jan 85 23:02:00-PST
OOPS, I had mentioned to him that i would mail it to the CS300 mailing list.
( I had earlier tried to get Karmakar for the CS300 colloq. )
I believe sending out a correction is not worth it in terms of attendees, but
I'll keep your corrected version around for inquiries.
Thanks Gio
-------
∂09-Jan-85 0054 @SU-SCORE.ARPA:KARP@SUMEX-AIM.ARPA Special CSD TGIF
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 00:53:52 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Wed 9 Jan 85 00:50:07-PST
Date: Tue 8 Jan 85 11:28:08-PST
From: Peter Karp <KARP@SUMEX-AIM.ARPA>
Subject: Special CSD TGIF
To: faculty@SU-SCORE.ARPA, students@SU-SCORE.ARPA, su-bboards@SUMEX-AIM.ARPA
cc: KARP@SUMEX-AIM.ARPA
This week we will have a special TGIF to welcome Nils Nilsson to
the department. We hope everyone will stop by to meet our new
chairman. It will be held at 4:30 in the 3rd floor MJH lounge.
Peter & Ramsey
-------
∂09-Jan-85 0921 LUNDSTROM@SU-SIERRA.ARPA MCC UNIVERSITY Affiliates Program
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 09:20:21 PST
Date: Wed 9 Jan 85 08:20:34-PST
From: Stephen F. Lundstro <LUNDSTROM@SU-SIERRA.ARPA>
Subject: MCC UNIVERSITY Affiliates Program
To: HK.PLD@SU-FORSYTHE.ARPA
cc: JMC@SU-AI.ARPA, Feigenbaum@SUMEX-AIM.ARPA, Ullman@SU-SCORE.ARPA,
CRC.EJM@SU-SIERRA.ARPA, Buchanan@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Genesereth@SUMEX-AIM.ARPA,
EENGELMORE@SUMEX-AIM.ARPA, Lundstrom@SU-SIERRA.ARPA
I would like to add my support to the Stanford participation in this program.
I have visited MCC also. I expect to have continuing contacts with both the
CAD and advanced architectures groups in any case. I did explore the
possibility of MCC support of research at Stanford. At present, that
does NOT seem to be in their plans (contact me for my opinions as to why).
I would expect opportunities for individual consulting activities.
Regarding this particular program, it is not totally without cost. MCC
would be paying for the meeting arrangements, etc. Anyone on the Stanford
side would have to pay their own way to the meetings (plus commit the
time of course). I also don't believe that the proposed meetings will
involve so much of a report of their research as a cooperative search for
productive future research directions.
In summary:
1. I believe that Stanford should participate in the MCC UNIVERSITY
AFFILIATES PROGRAM.
2. Because of the breadth of activities underway at MCC, that delegating
Stanford representation to one particular faculty representative would
likely limit the potential flow of information between MCC and Stanford -
that is, Stanford should have an interested group of faculty participating.
3. Any research funding benefits to Stanford are likely to only be
indirect - do not expect any research funding to come from MCC.
Steve Lundstrom
-------
∂09-Jan-85 0932 RA
Monica Suder (415) 550 0768 called a few times yesterday re cybernetics
interface device
∂09-Jan-85 0936 CL.BOYER@UTEXAS-20.ARPA mentioning Church-Rosser
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 09:36:18 PST
Date: Wed, 9 Jan 1985 11:36 CST
From: CL.BOYER@UTEXAS-20.ARPA
To: John McCarthy <JMC@SU-AI>
Cc: cl.shankar@UTEXAS-20.ARPA
Subject: mentioning Church-Rosser
In-reply-to: Msg of 9 Jan 1985 03:21-CST from John McCarthy <JMC at SU-AI.ARPA>
The student's name is Natarajan Shankar. It's splendid of
you to mention it.
∂09-Jan-85 1442 @SU-SCORE.ARPA:FEIGENBAUM@SUMEX-AIM.ARPA Re: the Computer X undergraduate program at Stanford
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 14:41:25 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Wed 9 Jan 85 14:35:33-PST
Date: Wed 9 Jan 85 14:34:27-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: the Computer X undergraduate program at Stanford
To: baskett@DECWRL.ARPA, faculty@SU-SCORE.ARPA
In-Reply-To: Message from "baskett@decwrl.ARPA (Forest Baskett)" of Tue 8 Jan 85 22:32:00-PST
I agree with Forest's prediction that there will be a Computer X
program somewhere at Stanford to handle the undergraduate program needs.
But I disagree with the conclusion Forest draws (last sentence of his
message). Why would that be a "tragedy for the department"?
Must we aspire to do everything? We have built a department of the highest
caliber by "specializing" in graduate education. We are famous for doing
our graduate education job very well. I don't feel that we need to guard
the turf called Computer YYY. By expanding to handle the new need (or perceived
need), we might just dilute the excellence for which we have striven, and
create many more headaches for ourselves.
Ed Feigenbaum
-------
∂09-Jan-85 1500 NILSSON@SU-SCORE.ARPA Lunch Topic
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 15:00:22 PST
Date: Wed 9 Jan 85 14:54:21-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Lunch Topic
To: faculty@SU-SCORE.ARPA
The subject of undergraduate computer education is my candidate for
the topic that most badly needs to be talked about at the next lunch.
Jim Gibbons is moving full speed ahead, Forest Baskett's msg stirred
up at least some interest, and I would like to hear more about
what our faculty think. Let's have that for lunch on Tuesday, Jan. 15,
12:15. (For my part, I will try to describe what I think are some
of the dangers--for Stanford and for the CSD--in "just letting whatever
happens happen." -Nils
-------
∂09-Jan-85 1516 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA meeting preemption
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 15:16:31 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 9 Jan 85 15:12:43-PST
Date: Wed 9 Jan 85 15:13:22-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: meeting preemption
To: f4@SU-CSLI.ARPA, f1@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
Having moved the F4 and F1 meetings to Mondays, we are now running
into the problem of meetings being preempted by Monday holidays. The
first occurrence of this will be on January 21, when Stanford
celebrates Martin Luther King day (a week later than the Palo Alto
public schools--much to my chagrin--but that is another story). The
question is whether to slip the F1/F4 alternation schedule by a week
whenever Monday is a holiday. Last quarter when this issue came up,
it turned out that some people had made other scheduling arrangements
that precluded doing this. Is anyone in that situation this quarter?
If there are no strong objections, I would like to handle things this
way, as the only alternatives are to try to find a time to make up the
missed meeting or to go a month between meetings.
--Bob
-------
∂09-Jan-85 1550 RA
Jay Yusko from ATT Bell Lab (312) 979 3564 called re concurrent LISP to run
on their machine. Talked to Russ Overbeek who referred him to you. Will be
in him office on Monday. Will try to reach Dick Gabriel to get the information.
∂09-Jan-85 1554 GENESERETH@SUMEX-AIM.ARPA Steve Tappel
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 15:54:36 PST
Date: Wed 9 Jan 85 15:53:07-PST
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: Steve Tappel
To: jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA
Gentlemen,
I just had a chat with Steve Tappel and suggested that he drop by and
talk with you both. I sort of inherited Steve when I cam to Stanford
and set him off working on problrm reformulation. He had some
interesting ideas and seemed very diligent about his work, but after
about 8 months or so, his interests drifted off into some philosophical
direction having to do with quantum physics. Tis sounds flaky I know
but his ideas were very interesting. Anyway, he subsequently left the
department. A few days ago he cam e to me and said he wants back into
the program. Tody I talked with him about what he wants to do. He
said he has some ideas about constraint incorporation in solving
geometry problems. We talked them over. The idea seemed good; his
presentation was poor and he didn't relate the ideas at all to current
work. I am reluctant to endorse his application because his ideas
still seem very undisciplined and from our discussion I got the impression
that he would still be unwilling to take direction. However, he is
very smart and I thought one of you guys might be willing to work
with him. If you don't want to see him, let me know and I'll head
hm off.
mrg
-------
∂09-Jan-85 1610 BARWISE@SU-CSLI.ARPA New Director
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 16:10:19 PST
Date: Wed 9 Jan 85 16:09:40-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: New Director
To: Wasow@SU-CSLI.ARPA, Sag@SU-CSLI.ARPA, Bresnan@SU-CSLI.ARPA,
Kiparsky@SU-CSLI.ARPA, Peters@SU-CSLI.ARPA, Etchemendy@SU-CSLI.ARPA,
Bratman@SU-CSLI.ARPA, JMC@SU-AI.ARPA, Winograd@SU-CSLI.ARPA, sf@SU-CSLI.ARPA
Dear SU Faculty at CSLI:
As you know, the Executive Committee recommended to Pat Suppes that
John Perry be the new director. Pat has seconded and forwarded our
recommendation to Gerry Lieberman. Lieberman asked me to canvas the
SU faculty at CSLI to see if they are enthusiastic about this
recommendation. My impression is that we all feel very lucky that
John is willing to take this on, but Lieberman would like a statement
from me that is a little more definitive than that. Would you please
send me a note telling me your feelings about this recommendation?
Thanks, Jon
-------
∂09-Jan-85 2255 @SU-SCORE.ARPA:pratt@Navajo X
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 22:51:04 PST
Received: from Navajo.ARPA (SU-NAVAJO.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Wed 9 Jan 85 22:48:10-PST
Date: Wed, 9 Jan 85 22:48:24 pst
From: Vaughan Pratt <pratt@Navajo>
Subject: X
To: faculty@score
The universities are the pinnacle of excellence, or of the ivory tower
syndrome, in the area of information gathering, organizing, storing, and
distribution. For the last few millennia they have been doing it manually.
Now there are machines to help. The idea that somehow the computer science
departments will be at the center of this revolution underestimates the
size, scope, and significance of the revolution.
The computer science departments will be to information processing as the
mathematics department is to calculation, and the physics department to
working with mechanical and optical equipment. They will have undergraduate
programs, not to cater to the revolution, nor to protect any turf (the
thought is ludicrous), but because as we streamline what we know and teach,
it becomes easier to teach it to progressively younger people.
Some of us will want to carry information down in this fashion, some to
go back up for more. Many will want to timeshare these two activities.
The department should above all preserve the flexibility needed for both
of these things to happen.
-v
∂09-Jan-85 2255 @SU-SCORE.ARPA:cheriton@Pescadero Re: the Computer X undergraduate program at Stanford
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 22:55:23 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Wed 9 Jan 85 22:49:50-PST
Date: Wed, 9 Jan 85 22:49:18 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: the Computer X undergraduate program at Stanford
To: FEIGENBAUM@Sumex-Aim, baskett@DECWRL.ARPA, faculty@SU-Score
Personally, I think we are pursuing the one of the worst courses of action
right now, naming expending dept. effort to develop an undergraduate program
for the Engineering school, which will most assuredly control it as
fiercely as they really control all the other things that are supposed to be
part CSD.
We should either build a high wall around us and refuse to sit or stand
in the same room with anyone who mentions an undergraduate program
(not an unreasonable option in my mind) or else develop our own program
and then see see if there isnt some common ground with EE/CSL.
I think a small, select undergrad program in this dept. might be the best
thing to do all things considered, but I cant imagine a program that I
would be happy with satisfying EE/CSL.
In my usual diplomatic fashion, I have already promised to quit before
I teach any of the watered down courses that are being promised for the
undergraduate program, referring to 042, 046, H20, etc.
∂09-Jan-85 2314 CLT
∂09-Jan-85 2312 JMC
Do you want to put together the logic characters for TEX coalition?
--------------------------------------------------------------------------
ok
i will start a file and talk to yk and zm
send me characters as you think of them
∂09-Jan-85 2325 @SU-SCORE.ARPA:reid@Glacier Re: the Computer X undergraduate program at Stanford
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Jan 85 23:25:19 PST
Received: from Glacier by SU-SCORE.ARPA with TCP; Wed 9 Jan 85 23:23:00-PST
From: Brian Reid <reid@Glacier>
Date: 9 Jan 1985 2325-PST (Wednesday)
To: David Cheriton <cheriton@Pescadero>
Cc: faculty@SU-Score
Subject: Re: the Computer X undergraduate program at Stanford
In-Reply-To: David Cheriton <cheriton@Pescadero> / Wed, 9 Jan 85 22:49:18 pst.
I'm not a part of the CSD; I'm part of the evil EE/CSL that David feels
has so badly mistreated him. I'm working hard on the undergraduate
program; it is going to happen, and it is going to happen soon. I think
that it would be nice to have CSD people involved in it, not so much
because I think that your brand of Computer Science is any holier than
mine, but because I think that the eternal war between us
pseudo-scientists over in the big bad Engineering school and you
Keepers of the Flame over in CSD might calm down a little if we managed
to agree on something like this.
I'm sick of fighting; I'm incredibly sick of two departments in two
schools, but in this case I am quite happy to claim a piece of
intellectual turf that might be construed to belong in your department,
and put it in mine. I think it was Lucy Van Pelt who was first
recorded as saying ``if you can't join 'em, then beat em.'' I will
really enjoy seeing the evolution of a Stanford in which the CS major
is not in the CS department. Maybe if I were in the CS department I'd
feel differently, but who knows?
Let me repeat my invitation to come visit the new CIS building, by the
way. The clean air is really great if you have allergies.
Brian
∂10-Jan-85 1000 JMC*
Kechris, reservations, etc.
∂10-Jan-85 1001 RA message for McCarthy
∂10-Jan-85 0931 TULEY@SU-SCORE.ARPA message for McCarthy
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 09:31:42 PST
Date: Thu 10 Jan 85 09:30:55-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message for McCarthy
To: RA@SU-AI.ARPA
Hi Rutie,
Please have John McCarthy call David (says he knows him) Ph 212-864-5320.
Thanks, Kim
-------
∂10-Jan-85 1001 ALDERSON@SU-SCORE.ARPA mantraps
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 10:01:15 PST
Date: Thu 10 Jan 85 10:00:07-PST
From: Rich Alderson <ALDERSON@SU-SCORE.ARPA>
Subject: mantraps
To: su-bboards@SU-SCORE.ARPA, jmc@SU-AI.ARPA
The prohibition against mantraps is indeed inherited from English common law.
However, the mechanism was nothing so humane as a gun-trap. The original
mantrap was a leg-hold trap, with or without teeth, somewhat larger than the
average bear trap used now. It was in use on country estates into the 1820s,
and perhaps later.
Rich
-------
∂10-Jan-85 1014 @SU-SCORE.ARPA:lantz@Pescadero Visit by Peter Kirstein
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 10:14:15 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Thu 10 Jan 85 10:12:08-PST
From: Keith Lantz <lantz@Pescadero>
Date: 10 Jan 1985 1010-PST (Thursday)
To: faculty@score, csl-faculty@sierra
Cc: dsg
Subject: Visit by Peter Kirstein
Peter Kirstein, Professor and Head of the computer science department
at the University College London, will be here on January 14. He would
like to talk with people about networking, workstations, and
CAD. If you are interested, please notify my secretary, Valerie Ross
(ross@su-score). (By the way, UCL has made some notable contributions
-- in networking, as the principal European extension of the ARPA
Internet community, and in workstation-related activities, with some good
work on multi-media mail, among other things.)
∂10-Jan-85 1119 RA
What was the purpose of your trip to Austin on Dec. 18?
∂10-Jan-85 1142 NILSSON@SU-SCORE.ARPA Lunch Topics
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 11:42:32 PST
Date: Thu 10 Jan 85 11:38:26-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Lunch Topics
To: faculty@SU-SCORE.ARPA
Faculty Tuesday Lunch Topics
Winter Quarter, 1985
Tentative Agenda
Jan. 15 Undergraduate Computer Major
Jan. 22 CSD Graduate Admissions Policy and Initiatives
Jan. 29 "If we had the slots, who would we want to hire?"
Feb. 5 The New Stanford Telephone System
Guest: Mike Roberts, Deputy Director ITS
Feb. 12 What Equipment Ought A First-Class CS Dept. Have?
Feb. 19 The Role of Televised Instruction at Stanford
Guest: James Gibbons, Dean of Engineering
Feb. 26 The New Stanford CSD Building: How do we
convert myth into reality?
(Maybe we'll have a guest.)
As yet Unscheduled--but not forgotten:
CSD, CSL, and EE
(Guests from CSL and Robert White)
The Math/CS Library (Guest: Harry Llull)
"Up the Organization" (Guests: Gordon Bower and/or James Rosse)
[Please send suggestions for other topics (and any reasons why the
above dates/topics are impossible) to Nils Nilsson]
-------
∂10-Jan-85 1300 JMC*
Call Griffiths about existence.
∂10-Jan-85 1446 RA
1. You have a meeting at 2:30 @ 242
2. Chuck Williams called, would like to get together with you this afternoon
around 4:30. What shall I tell him when he calls?
3. David Chudnovsky would like you to call him at home.
∂10-Jan-85 1517 RA
Chuck Williams will be here at 5:30
∂10-Jan-85 1634 ullman@diablo Supercomputing center
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 16:34:51 PST
Date: Thu, 10 Jan 85 16:33:46 pst
From: Jeff Ullman <ullman@diablo>
Subject: Supercomputing center
To: jmc@sail
I had hoped to catch you after the meeting, but I would
like to talk at some time about the joint SRI/berkeley/Stanford
center. I did catch Ed, who tells me you have progressed quite
a bit towards a HEP. I don't know what your reaction to the
existence of another center would be, but I'd like to get you
officially involved, to the extent of being on a "steering committee"
(Ed has agreed). At a minimum, we could use from you the right
to mention your name and research interests briefly in a "white paper"
that would be sent to GE, NSF, and a few other potential funders.
---Jeff
∂10-Jan-85 1746 @SU-SCORE.ARPA:HK.PLD@Forsythe MCC's University Affiliates Program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 17:46:31 PST
Received: from Lindy by SU-SCORE.ARPA with TCP; Thu 10 Jan 85 17:45:40-PST
Date: Thu, 10 Jan 85 17:46:49 PST
From: Patricia L. Devaney <HK.PLD@Forsythe>
To: MCCARTHY@SU-SCORE
Subject: MCC's University Affiliates Program
Gentlemen: As most of you know, MCC is going to establish
a University Industrial Affiliates program in which they will
bring together faculty from various universities to discuss new
research directions which should or are being explored. Although
there will be no fees for participating, participants will be
expected to pay their own travel and lodging costs at the
sessions hosted by MCC in Texas. Bobby Inman has asked Don Kennedy
if Stanford would like to participate. Several of you have
already indicated to me that you think we should say yes.
So Don will send a letter back to MCC indicating that Stanford
will participate. In that letter we would like to list all
the Stanford faculty who are interested in being contacted,
so that MCC can notify you directly without the need for a
single Stanford contact. Thus, I am writing to ask each of
you to let me know if you would like to be listed as a contact.
So far, Ed Feigenbaum, Stephen Lundstrom and Jeff Ullman have
all said yes. I would appreciate your response as soon as
possible. Give me a call at x3763 if you'd like more information.
Thanks, Pat Devaney
To: CHERITON@SCORE, MEINDL@SIERRA, NIELSON@SCORE, TOBAGI@SIERRA, GIO@SAIL,
LINTON@SIERRA, MCCARTHY@SCORE, MCCLUSKEY@SIERRA, BUCHANAN@SCORE,
SHORTLIFFE@SCORE
cc: GENESERETH@SCORE, LUNDSTROM@SIERRA, FEIGENBAUM@SCORE, HK.GJL
∂10-Jan-85 2218 ullman@diablo re: Supercomputing center
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 22:18:38 PST
Date: Thu, 10 Jan 85 22:17:38 pst
From: Jeff Ullman <ullman@diablo>
Subject: re: Supercomputing center
To: JMC@Sail
Would you be on the committee if almost all the work were done
by computer mail?
∂10-Jan-85 2240 ullman@diablo re: Supercomputing center
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 10 Jan 85 22:40:25 PST
Date: Thu, 10 Jan 85 22:39:25 pst
From: Jeff Ullman <ullman@diablo>
Subject: re: Supercomputing center
To: JMC@Sail
I couldn't get the inflection on your last email message;
was it "I supPOSE so" or "I suppose SO"?
Maybe we could have a brief face-to-face.
∂11-Jan-85 0822 djl%brandeis.csnet@csnet-relay.arpa Logics of knowledge
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 11 Jan 85 08:21:55 PST
Received: from brandeis by csnet-relay.csnet id aa17360; 11 Jan 85 11:16 EST
Received: by brandeis.ARPA (4.12/4.7)
id AA00393; Fri, 11 Jan 85 10:45:13 est
Date: 11 Jan 1985 10:24-EST
From: djl%brandeis.csnet@csnet-relay.arpa
In-Real-Life: Daniel Lehmann,faculty
Subject: Logics of knowledge
To: jmc@su-ai.ARPA
Message-Id: <474305051/djl@brandeis>
Dear Professor Mc Carthy,
I have recently done some work on a logical propositional system for
conducting reasoning involving Time and Knowledge. It included a formal
solution to the "three wise men" puzzle that you made popular. This was
presented at the Principles of Distributed Computing conference in
Vancouver. If I remember correctly I did send you a preprint of this
work (if not Moshe Vardi has a copy). I am now working on an extended
system involving beliefs.
I would be glad to receive reprints and preprints of your work on the
subject. I would also like to ask your opinion as to what are the major
challenges for research in the area bordering on A.I. and Logics.
I am presently on sabbatical leave from Hebrew University (in
Jerusalem) and visiting at the C.S. department of Brandeis University,
Waltham, Massachusetts 02254. My electronic address is djl@brandeis on
Csnet.
I would very much like to discuss those topics with you and am trying
to arrange a trip to the West coast for June. Will you be at Stanford
at this time?
Sincerely yours,
Daniel Lehmann
∂11-Jan-85 1022 KAELBLING@SRI-AI.ARPA Your book
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 11 Jan 85 10:21:56 PST
Date: Fri 11 Jan 85 10:22:24-PST
From: Leslie Kaelbling <KAELBLING@SRI-AI.ARPA>
Subject: Your book
To: jmc@SU-AI.ARPA
I'm trying to study for the comp, and Lisp: Programming and Proving
is on the reading list. I have an edition from two years ago. Have
there been significant changes since then?
I'm also curious about the course you're teaching this quarter. I took it
two years ago. Is it likely that there will be any new material? I'd
be interested in hearing anything new that you might have to say.
- Leslie
-------
∂11-Jan-85 1027 RA AAAS symposium
Manfred Kochen called re symposium (313) 764 2585. He needs the title
of your talk. You can either call him or let me know and I'll call him.
Also, your abastract must reach teh AAAS office in Washington by Jan. 15.
Their address: AAAS, Attn: Elizabeth Zeutschell, 1101 Vermont Avenue, NW,
10th floor, Wahington DC 2305.
∂11-Jan-85 1109 RA
John Nafeh from MAD would like to get together with you next week. Please
call him (56) 943 1711.
∂13-Jan-85 1022 BOSACK@SU-SCORE.ARPA Common-access terminals in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jan 85 10:22:40 PST
Date: Sun 13 Jan 85 10:19:51-PST
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Common-access terminals in the Math/CS Library
To: Faculty@SU-SCORE.ARPA
The Math/CS library has some space we can use for 5 to 10 common-access
terminals. Although less than ideal in terms of access and location, the idea
seems reasonable. Comments pro or con?
Len
-------
∂13-Jan-85 1052 FIKES@USC-ECL.ARPA AAAI Executive Council Minutes
Received: from USC-ECL.ARPA by SU-AI.ARPA with TCP; 13 Jan 85 10:52:02 PST
Date: Sun 13 Jan 85 10:48:05-PST
From: Richard Fikes <FIKES@USC-ECL.ARPA>
Subject: AAAI Executive Council Minutes
To: JMC@SU-AI.ARPA
cc: FIKES@USC-ECL.ARPA, AAAI-OFFICE@SUMEX-AIM.ARPA
John,
I am putting together the minutes of the 1984 Executive Council
meeting. I would appreciate your help in filling in the holes in my
notes and would like your general comments on omissions and errors in
the draft included below. In particular, do you remember what was
said about the membership directory? about Publications? about
IJCAI-85? Regarding the workshop program. I thought a sentence was
needed saying what workshops were done on the program. Can you
provide such a sentence(s)? The minutes need to be completed asap, so
I would appreciate your prompt attention to them.
thanks much,
richard
----------
American Association for
Artificial Intelligence
Minutes
Fifth Annual Meeting, 8 August 1984
The University of Texas at Austin, Austin Texas
John McCarthy, President (1983-1984), presiding
Finances
Richard Fikes reported that the AAAI is financially solvent.
The conference revenues this year were outstanding; the gross revenues
were approximately $537,000 for the tutorials, and $363,000 for the
remainder of the conference. Assets of over $960,000 for the
Association are projected for the end of the year.
AAAI Office
Claudia Mazzetti ?????
Election Results
Nils Nilsson announced that Pat Winston is the President-Elect
for 1984-85. xxx will serve on the Council for 1984-87. 23% of the
membership voted in the election.
Conference Technical Program
Ron Brachman reported that approximately 370 papers were
submitted and 69 accepted this year. Innovations in this year's
program included xxx. The Publisher's Prize will be sponsored by
Addison-Wesley in 1985. A committee was appointed to propose
guidelines for the technical program for the next conference. [Is that
the correct charter for this committee?] The committee consists of
Marty Tenenbaum (chair), Ron Brachman, and Mike Genesereth.
Conference Tutorial Program
Doug Lenat reported that there were approximately 2600
attendees at this years's tutorial program. There was widespread
concern on the Executive Council about inequities and excesses in the
compensation policies for the tutorial speakers. Woody Bledsoe will
appoint a committee to address those issues and oversee future
tutorial programs.
Production and Sale of Tutorial Videotapes
A proposal by Scientific DataLink to produce and market
videotapes of the tutorials in collaboration with the AAAI was
presented. The proposal was considered to be an inappropriate
activity for the Association and rejected.
Membership
Bruce Buchanan reported that the Association's membership has
increased from 3,000 to 6,100 this year. A AAAI membership directory
will be produced; members will be listed in the directory only if they
give their explicit permission. [We said this last year. Still no
directory. Is this what Bruce wants said in the minutes about the
directory?]
Publications
Lee Erman ??? Copyrighting magazine??? There was discussion
of allowing some company publish conference abstracts??? There was a
motion passed that abstracts be in the public domain. What abstracts?
??? The Secretary-Treasurer was directed to negotiate a new contract
with Kaufman.
IJCAI-85
Don Walker ???
Future Conferences
The Conference Committee was asked to consider the
desirability of having two conferences per year, one oriented toward
research interests, the other toward application interests.
Woody Bledsoe will appoint a committee to determine and
implement a policy for running the exhibit program for future
conferences.
Future conference sites??? Change in time of year for
conferences??
Workshop Program
John McCarthy reported that ??? McCarthy was appointed to be
the standing chairman of the Association's workshop program.
Proposed Projects
Mike Genesereth proposed the establishment of an Association
sponsored on-line library and abstract service. He was asked to
submit a written proposal on the matter to the Executive Committee for
consideration.
John McCarthy proposed that the AAAI offer post-doctoral
fellowships to promote AI research. No action was taken on the
proposal.
Peter Hart proposed a "nobel prize" style award for
outstanding AI research. The proposal was forwarded to Woody Bledsoe
for further action.
Peter Hart proposed that the AAAI sponsor a series of
educational radio programs on AI to be aired on National Public Radio.
Peter was authorized to spend $5,000 to hire an independent journalist
to do a pilot program for the series.
Transfer of the Presidency
McCarty ended his term as president by turning the platform
over to Woody Bledsoe.
Terms of Office
A motion was made and passed unanimously to extend the
President's term of office to 2 years, beginning with Pat Winston's
presidency in 1985. Marty Tenenbaum was directed to put together a
proposal to establish a policy on the length of terms of the
secretary-treasurer and of the standing committees.
Long Range Planning
Woody Bledsoe will appoint a committee to do long range
planning for the Association.
The meeting was adjouned.
-------
∂13-Jan-85 1124 CLT see you wednesday
Monteleone Hotel, New Orleans, 504-523-3341
room 731
7:55pm, Continental 117 from Houston, 101 to Houston
∂13-Jan-85 1231 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Re: Common-access terminals in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jan 85 12:31:42 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Sun 13 Jan 85 12:28:47-PST
Date: Sun 13 Jan 85 12:28:18-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: Common-access terminals in the Math/CS Library
To: BOSACK@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
In-Reply-To: Message from "Len Bosack <BOSACK@SU-SCORE.ARPA>" of Sun 13 Jan 85 10:20:46-PST
pro - great for MS students.
I believe it is better to have 5 terminals, with some working space,
than 10 piled on each other.
Of course 10 with space would still be better. Gio
-------
∂13-Jan-85 1442 NILSSON@SU-SCORE.ARPA Hewlett-Packard Machines
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jan 85 14:42:22 PST
Date: Sun 13 Jan 85 14:39:44-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Hewlett-Packard Machines
To: faculty@SU-SCORE.ARPA
cc: "*PS:<NILSSON>BUREACRATS..1"@SU-SCORE.ARPA
I have just heard from Ira Goldstein that Hewlett-Packard has formally
approved a large equipment grant to universities. Previously, HP had
informally made some workstation-machines available to MIT, to UTexas,
and perhaps others. Ira says that HP wants to give some machines to
Stanford (and to other top CS departments). Here's the deal as I
remember details from the phone conversation with Ira:
The machines (this year) are 68010-based work stations with bit-mapped
graphics, common lisp, a version of unix, (and maybe some other
features I've forgotten). Although ethernet compatible, apparently
they do not use TCP/IP. Ira says that Ivan Sag and Tom Wasso of the
Stanford Linguistics Dept. (using the machines as HP consultants) think
they are better and faster than the Xerox Dandelions they also use as
part of CSLI.
Ira thinks that an appropriate number for Stanford might be 20 or so,
but if we can demonstrate we really need them, we are not to regard
20 as the upper limit--it might be 30.
This year's machines (to be delivered in late Spring (85) are
68010-based. They will be upgraded every year. Next year, they
get 68020 chips. The following year, they get some special HP
chip.
Since the machines are a gift and not part of a contract with
Stanford, HP is not expecting anything specific in return. Ira
made it clear, however, that HP expects the machines to be used
in research projects appropriate to the machine, that the results
of the research will be published in the open literature, and that
the faculty members to which the machines will be assigned will
participate in some sort of once-a-year gathering at HP to
talk about the wonderful things being done with the machines.
Ira imagines that Wasso and Sag will be getting some of the machines.
He said that Mike Carter has talked to HP about using some in the
"computer residence," but Ira thinks that the machines are too
powerful and expensive for that purpose. He says he has not yet
talked to people in CSD about them.
So---what do we do? Who might be interested? HPP (now known as
the Knowledge Systems Lab) and other AI professors come to
mind as candidates (because the machines are a kind of
lisp machine), but I'm sure there are others who would be
interested (because the machines are also a generally useful
workstation--according to Ira).
I would like the computer facilities committee to think about this
and to coordinate for the department who might be interested. I
told Ira I would be getting back in touch with him later this week
to give some preliminary indications about possible uses for the
machines. I'll send this note to the whole faculty, but people
should respond to Dave Cheriton (head of the facilities committee).
-------
∂13-Jan-85 1515 RPG Sequent
To: JMC@SU-AI.ARPA, CLT@SU-AI.ARPA, LES@SU-AI.ARPA,
cheriton@SU-PESCADERO.ARPA, JJW@SU-AI.ARPA
I lean towards using the Sequent machine over the Synapse machine.
This is because the Sequent machine is designed to run programs
more closely in the spirit of Qlambda than Synapse, the operating system
is more familiar (basically Berkeley 4.2), the designers are more
aligned with our point of view, and the machine is a lot cheaper.
This last point might be important. My reading of Kahn is that he
is most likely to fund a cheaper non-HEP than anything else besides the
HEP. If we abandon the HEP, his choice is the Butterfly. The
Butterfly is still, in my view, in the running, and is DARPA insists,
I think we can live with the Butterfly.
For the price of one Synapse, we can get almost 3 Sequent's.
The cost of porting our Lisp to a 32032 (or 32016) is much less than
hassling with no ethernet and not much operating system support
from Synapse.
What say you?
-rpg-
∂13-Jan-85 1525 RPG My appointment
Will this appointment mean that I will be able to discuss issues
with the faculty? In particular, I just saw that HP is thinking of giving
some 9836's to CSD, representing that they run Common Lisp. What they run
is a Common Lisp compatability package on top of PSL (though this might
change). Given this, they are of limited use to the department until they
are more fully Common Lisp. In particular, the Lisp will need to be made
lexical, both in the interpreter and compiler, before they do not cause
programmer madness.
I guess what I'm saying is that I'd like to be on the faculty mailing list.
-rpg-
∂13-Jan-85 1559 NILSSON@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jan 85 15:58:50 PST
Date: Sun 13 Jan 85 15:52:30-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: RPG@SU-AI.ARPA, NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 13 Jan 85 15:31:00-PST
I've asked RPG@su-ai to be added to the faculty mailing list. (I take
it he doesn't think much of the HP machines. Even if they cause
madness among lisp programmers, can they be used for anything else?)
-Nils
-------
∂13-Jan-85 2053 RPG HP Machines
To: nilsson@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA
Nils,
According to my benchmarks the HP machines perform very well. As teaching
machines, especially if they are running Scheme - which is what they do
at MIT - then they are excellent. I would happily teach a Lisp course with
them. In terms of encorporating them into the Stanford environment of the
present and of the future, they must run *very* closely to the Common Lisp
standard, and they must run TCP/IP.
I think that we must be aware that what we would be getting is not as
immediately useful as either 3670's or Dandelions, and that we will
fragment our research community if they do not conform as mentioned
above.
Some of us should chat with Ira about their long term plans and see
when they will be closer to Common Lisp (I expect that they are
moving rapidly in this direction now that they have a group in Colorado
working on it) and when they will run an Ethernet protocol that we
also run. I would say that a machine that does not run TCP/IP is of
minimal use as a research machine around the department.
With the right answers to these questions I think we ought to grab them.
With the wrong answers we should politely decline them.
-rpg-
∂13-Jan-85 2226 cheriton@Pescadero Re: Sequent
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 13 Jan 85 22:26:02 PST
Date: Sun, 13 Jan 85 22:25:08 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: Sequent
To: CLT@Sail, JJW@Sail, JMC@Sail, LES@Sail, RPG@Sail,
cheriton@SU-PESCADERO.ARPA
How real is the Sequent machine? What form of extensions to Unix have they
to support fine-grain parallelism? Do you have anoy idea of the performance
you can get under their operating system?
As I understand the Butterfly, all Lisp data structures would have to be
in "shared" memory with no cache between the processors and the memory,
suggesting a possible problem with contention on the memory switch.
Does anyone know anything about whether this will be a problem or not.
After all, half of Synapse's effort has gone into a cache to avoid
precisely this type of contention, and most multi-micro projects are
doing something similar (cache-wise) now.
Personally, I feel much safer and comfortable with the 680X0 family of
processors, especially with the 68020 coming.
But I have never looked hard at Sequent.
∂14-Jan-85 0846 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 08:46:22 PST
Date: Mon 14 Jan 85 08:43:01-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
The Use of Formal Specification of Software;June 1979 Berlin. ed. by Berg and
Giloi QA76.6.U83
Graph Theory. Proceedings of the Fourth Yugoslav Seminar on Graph Theory. Novi
Sad April 1983. (8413266)
Software Engineering; Proceedings of ESA/ESTEC Seminar Noordwijk, The
Netherlands, October 1983 (8405382)
Construction of Data Processing Software by Elder QA76.6E434 1984
Parallel Algorithms on a Multiprocessor by Oleinick QA76.8.C14O433 1982
Introducing Relational Database. NCC. by Mayne and Wood QA76.M3911 1983
File Management Techniques by Claybrook QA76.6F5C55 1983
H.Llull
-------
∂14-Jan-85 0859 NILSSON@SU-SCORE.ARPA Undergraduate Computer Education
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 08:59:10 PST
Date: Mon 14 Jan 85 08:44:41-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Undergraduate Computer Education
To: faculty@SU-SCORE.ARPA
cc: JF@SU-SCORE.ARPA, Lamping@SU-SCORE.ARPA
The msg John McC sent around containing today's New York Times
article shows how timely this subject is. At tomorrow's faculty
lunch, I'm going to TRY to do more listening than talking--so I
thought I would get my preliminary opinions out on the table via
this msg:
UNDERGRADUATE COMPUTER EDUCATION AT STANFORD: THREE ALTERNATIVES
(DRAFT FOR DISCUSSION)
Nils Nilsson, January 14, 1985
The many discussions and opinions about an undergraduate computer
major at Stanford prompt me to predict three possible alternative
courses of events. Since this whole topic shows a remarkable ability
to spontaneously accrete complexity, perhaps no apology is necessary
for oversimplifying these scenarios.
Scenario A: The Stanford CSD continues to be a ``graduate-degree-only''
department. Since there are compelling reasons to offer some kind of
undergraduate degree in computers at Stanford, this scenario would
involve some other department or school (probably Engineering)
creating and running an undergraduate program.
Scenario B: The CSD and Engineering both want to offer an
undergraduate program but find they cannot agree about its content
and/or management with the result that two programs are offered, one
in Engineering and one in the CSD.
Scenario C: The CSD and Engineering cooperate to create what they both
consider to be a first-rate undergraduate program and are able to
agree on how it should be managed.
There might be people who would be comfortable with each of these
courses of events. I think it is in the best interests of Stanford
and of computer science to devote effort to bring about scenario C,
and I will try to explain why.
Dangers of Scenario A: Here are some problems that I think will arise
if a single academic discipline (like computer science) has an
undergraduate program in one department or school and a graduate
program in another.
1. This situation is unstable. The graduate department (as the
keeper and originator of advanced knowledge in the field) sooner or
later is likely to become dissatisfied with how the undergraduate
department is educating people and would then set up its own
undergraduate program. The undergraduate department sooner or later
is likely to want to have its own graduate program (if for no other
reason than to be able to attract better faculty). In either case the
result would be two competing departments--a regression to Scenario B.
2. Some professors could teach equally well in both departments and
would be in equal demand by both departments. Thus there would be
interdepartmental competition for hiring new faculty. One department
is likely to be able to attract better faculty than the other.
Differences in quality tend to accelerate because the better faculty
is able to attract the better prospects. The graduate department is
likely to have the edge because first-rate people will want to do
research also. (These effects cannot be ignored in a field in which
there is a severe shortage of top people.) Thus it is unlikely that
both departments would be excellent.
Dangers of Scenario B: Suppose both the CSD and Engineering offer
undergraduate majors in computers. It is extremely likely that
Engineering will soon also offer a graduate degree in some aspect of
computers as a logical extension of its undergraduate program. Thus,
unless there is some reasonable way to divide the intellectual content
of the field between CSD and Engineering there will be unproductive
competition between the two entities. (I know of no happy instances
in which substantially the same discipline is represented in more than
one place in a university. UC Berkeley had essentially two computer
science departments for a time, but that situation is not one that I
would think Stanford would want to repeat.)
The problems of competition would, of course, be less severe if there
were ways to divide the field so that Engineering covered some parts
and the CSD covered other parts. Unfortunately, I know of no
``natural boundaries'' running across the discipline of computer
science that could usefully separate the CSD's and Engineering's
interests. Here are some ``candidate boundaries'' and what I think is
wrong with them:
A) Theory => CSD; Applications => Engineering. Although some think
that history at Stanford supports a split like this, the CSD actually
is rather well known for some of its applications (e. g., in AI). In
any case, I think it would be quite unhealthy to separate theory from
practice. Other disciplines that are like computer science (e.g.,
statistics, applied math, and branches of engineering) are most robust
when theory guides applications and applications inspire theory. Both
theory and applications would be the poorer if they were in separate
departments. It should be noted, for example, that the Stanford E.E.
Department has a fine reputation in both theory and applications.
B) Algorithms, Data Structures, Software Systems, etc. => CSD;
Circuits, Hardware => Engineering.
This split (sometimes called the bits/electrons split) makes a great
deal of sense, although the boundary ought not to be drawn too
sharply. Perhaps the CSD would be comfortable with this division, but
I doubt that Engineering would. Most people regard hardware as an
important and integral part of computer science.
C) Systems (hardware and software) => Engineering
Everything else => CSD
This split is something like the applications/theory split, although
it restricts ``applications'' to the systems area, excluding
other applications (e. g., numerical analysis, AI).
Discussion of Scenario C: In most other universities in which there
are graduate and undergraduate programs in computer science, both
programs are located in the same department. Also, I know of no
universities where there are two departments each specializing in a
substantial portion of computer science. If the CSD were already in
the Engineering school, perhaps the problem we are discussing now
would not have arisen--or would have arisen differently. But since
history at Stanford unfolded as it did, and since no one would deny that
Engineering has a legitimate interest in the discipline, the CSD and
Engineering must cooperate if the unity of computer science at
Stanford is to be preserved. I think this is a worthy goal, and we
should work hard to achieve it before settling for one of the other
less desirable scenarios.
There are some pitfalls to avoid, however, as we work to develop
Scenario C. One problem concerns how the program should be managed.
We have a dilemma. To house the program in the existing CSD ignores
Engineering's legitimate interest and concern for shaping and managing
the program. To house it in Engineering splits it from much of its
intellectual home in the CSD--a regression to Scenario A. An
interdepartmental program shared in some way by Engineering and the
CSD may provide a temporary (and starkly anomalous) answer--but with
the minor problem of which school grants the B.S. Although there may
be intellectual grounds for considering a subject such as Human
Biology interdepartmental, computer science is already recognized as a
single discipline at most universities. There is really nothing
``interdepartmental'' about it. One rather bold solution might be to
move the CSD into Engineering, expand it to include some of CSL, and
then put the new undergraduate major in the CSD. (I expect that not
everyone would be happy with this idea, but it is difficult to come
up with alternatives.)
Also, in attempting to bring about Scenario C, there is always the
problem of settling for something that looks a lot more like
Scenario B. If ``cooperating'' results only in Engineering
dealing with systems and some applications and in computer science
dealing with theory, then we regress to Scenario B.
Many have pointed out that a disadvantage of offering any kind of
undergraduate program in computer science is the stress that it would
place on our already limited resources. This danger seems to be
equally present (as far as Stanford as a whole is concerned) in all
three scenarios--although Scenario B may use resources inefficiently.
To add a program that Stanford does not now offer will require
Stanford to provide the resources needed to staff it. If the CSD
plays the sort of role that it should, it has a right to presume that
the necessary resources will be made available. (Stanford must be
careful not to underestimate how much in the way of resources will be
needed. The Jan. 14, 1985 front-page article in the New York Times
describes the stresses that current interest in computer science is
placing on some universities.)
Another consideration that weighs equally in each of the scenarios is
that the undergraduate program must be planned to have slow (rather
than rapid) growth. There is a shortage of ``Stanford-quality''
computer scientists, and we must avoid the temptation to let the
pressures of a program grown too large too fast work toward
hiring mediocre people.
I don't think there is anyone at Stanford who wants an undergraduate
program merely to train ``systems programmers.'' We all think of
the program as granting a ``non-terminal'' B. S. degree, in the sense
that most graduates will go on to pursue graduate study in some
field--perhaps many in computer science. Thus, we all agree that
any undergraduate computer major must be of high quality. It will
be a difficult major and thus may not attract quite as many people
as it might at some other universities.
If it turns out that there is a consensus for Scenario C, our first
step should be to make that path more explicit by designing the
content of the curriculum. The committee appointed by Jim Gibbons
(Bill Reynolds, John Gill, Forest Baskett, Jeff Ullman, Brian Reid,
and Nils Nilsson) has already devoted some effort to that task, and I
think that prospects for agreement are reasonable. Agreement about
the curriculum is probably going to be easier than agreement about
what to call the program or where to put it. But if we can settle on
a first-rate curriculum, maybe the other matters will more easily fall
into place.
-------
∂14-Jan-85 0900 fateman%ucbdali@Berkeley small conference on symbolic high-speed computation
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 08:59:53 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.40)
id AA20417; Mon, 14 Jan 85 08:52:18 pst
Received: by ucbdali.ARPA (4.24/4.40)
id AA08181; Mon, 14 Jan 85 09:00:44 pst
Date: Mon, 14 Jan 85 09:00:44 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8501141700.AA08181@ucbdali.ARPA>
To: jmc@su-ai
Subject: small conference on symbolic high-speed computation
Cc: clt@su-ai, rpg@su-ai
I've prompted the organizers of this meeting to invite John
(or alternatively, a surrogate in RPG or perhaps some other person)
to attend; if there is interest, please respond to me. Thanks.
....
details:
The enclosed letter to Bernie Chern of NSF
(somewhat altered to correspond to current dates and understandings)
should provide some details as to our objectives.
....
Dear Dr. Chern:
This letter is to serve as an unofficial addendum to our proposal
"Workshop on the Research and Development of a High Performance
Architecture for Symbolic and Numeric Applications." As you requested,
we are listing the specific agenda of the three-day workshop.
Day 1. (Feb 13)
8:30 am - 10:00 am. Convene. Overview of the Workshop. What we are trying
to accomplish. Focus on the Symbolic and Numeric together.
10:30 am - evening. Break up into seven individual sessions. Each group
will independently address the architectural needs of one application area.
The seven application areas (and a suggested chairman for each) are as
follows: Signal Processing (H.T. Kung or Earl Schwartzlander), Speech (Fred
Jelinek), Vision (Mike Brady), Robotics (Jack Schwartz or Keith Doty),
Knowledge Based Systems (Nils Nilson), Symbolic Computing (Richard Fateman),
and Intelligent Data Bases (Fernando Pereira).
The seven groups will meet as separate groups for the remainder of the day
and evening. Prior to the workshop, the group chairmen will contact members
of their groups to get some consensus as to the focus of their particular
session. The day will be spent refining the requirements of an architecture to
handle that application area. At the end of the evening each session will
have produced a position statement governing the needs of that application
area to be supported by the architecture.
Day 2. (Feb 14.)
The entire day will be spent resolving the issue: Can applications from these
seven areas, requiring both numeric and symbolic computation, be handled
optimally by a single computer system ?
8:30 am - 11 am. Reports of the individual session chairmen. Each chairman
will provide a 20 minute report of the activity of his/her group. These
reports will provide the basis for the discussions to follow.
11 am - evening. Discussion. Can numeric and symbolic be done optimally on
a single system? If so, characterize that system. If not, why not?
Day 3. (Feb 15)
8:30 - 10:00 am. Complete the characterization for an architecture
to support symbolic and numeric computations. Or complete the position
statement that such an architecture should not be attempted.
10:30 - 5:00 pm. Address the issue and produce a statement (if appropriate)
detailing how an environment of people and equipment should be organized
for producing the world's fastest Supercomputer.
{added later in discussion with Dr. Chern:
This statement should include specific recommendations for
a forthcoming major NSF funding initiative in the area of supercomputer
architecture.}
I trust that the above agenda answers the questions that have been raised as
to the format and objectives of the workshop. If we can provide any further
input, please do not hesitate to contact us.
Sincerely yours,
Yale N. Patt
Project Director
Alvin M. Despain
Principal Investigator
∂14-Jan-85 0908 @SU-SCORE.ARPA:SHORTLIFFE@SUMEX-AIM.ARPA Re: Hewlett-Packard Machines
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 09:08:43 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Mon 14 Jan 85 08:56:26-PST
Date: Mon 14 Jan 85 08:56:01-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Re: Hewlett-Packard Machines
To: NILSSON@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA, "*PS:<NILSSON>BUREACRATS..1"@SU-SCORE.ARPA
In-Reply-To: Message from "Nils Nilsson <NILSSON@SU-SCORE.ARPA>" of Sun 13 Jan 85 14:40:31-PST
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
Ira Goldstein's group, in conjunction with the medical products group
at HP, donated 5 of an earlier generation of these workstations (a 68000-based
version) to our medical information sciences program about a year ago. We've
had good experience using them so far, and anyone who is interested would
be welcome to stop by our offices at the medical school to get a feel for their
capabilities. The LISP is Portable Standard LISP, and HP has developed their
own knowledge engineering environment on top of PSL (known as HPRL). We have
NOT seen Ethernet boards or protocols yet, although they are rumored to be
imminent, as are versions of the LISP environment that will run under UNIX
(the current workstations use their own operating system). We've been using
color monitors of relatively low density but have seen the black and white
high density monitors that HP folks have been using inhouse, and they are
essentially the same as a Dandelion display. Haven't seen a mouse attached to
one of these yet, but we've been using graphics tablets for some applications.
The HP network and file-server that came with the package has served us well.
Our only complaint thus far (one that should presumably soon be addressed) is
our reliance on TTY lines for all communication with other Stanford systems.
Ted
-------
∂14-Jan-85 0915 LIBRARY@SU-SCORE.ARPA SOCRATES--New Developments
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 09:15:17 PST
Date: Mon 14 Jan 85 09:03:42-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: SOCRATES--New Developments
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
For those of you who have received your SOCRATES (the library's online
catalog) accounts, you will be glad to hear that these accounts which
now are searchable only at nights and weekends will be able to access the
library catalog during the day also some time in February. Be looking for
my announcement when that happens. In addition, I expect the technical
reports file to be available through SOCRATES sometime within the next
six months.
For those of you who do not have a SOCRATES account, you may come by the
Math/CS Library, fill out a form, and I will give you an account which
you can immediately use. Learning to use SOCRATES and having your own
account will become more important within six to nine months. All new
materials added to the Stanford University Libraries, including the Math/CS
Library will be indexed only in the online database SOCRATES. At some point
the catalog will be closed and cards will no longer be added to the card
catalog for new books. I am working on adding more terminals to the Math/CS
Library. However people with their own SOCRATES accounts and who are
familiar with searching SOCRATES will be able to avoid any queues which
might develop with library-dedicated terminals.
If you have any questions about accessing SOCRATES, send me a message.
I would also be interested in hearing your reactions to searcing the
library's online catalog--good, bad, suggestions for making it easier
to use.
Harry
-------
∂14-Jan-85 0951 RA
Pat Hayes is in town and would like to meet with you. Please call him
496 4639.
∂14-Jan-85 1105 RPG Conference
To: fateman%ucbmike@UCB-VAX.ARPA
CC: JMC@SU-AI.ARPA
I would like to go.
-rpg-
∂14-Jan-85 1105 RPG
that's the berkeley supercomputer conference that fateman's note refers to
∂14-Jan-85 1304 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F1/F4 meetings
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 13:04:27 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 14 Jan 85 12:57:51-PST
Date: Mon 14 Jan 85 13:01:37-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F1/F4 meetings
To: f1@SU-CSLI.ARPA, f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
There have been no objections to my proposal for scheduling the F1 and
F4 meetings so, with John Perry's concurrence, the alternation will
simply slide by a week whenever Monday is a holiday. E.g., F1 is
meeting today, 1-14, so normally next Monday, 1-21, there would be an
F4 meeting. However, next Monday Stanford observes Martin Luther King
day, so the next F4 meeting will be on 1-28, with the next F1 meeting
the week after that, and so on.
I hope this is clear.
--Bob
-------
∂14-Jan-85 1808 BERG@SU-SCORE.ARPA Course listing
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 18:08:34 PST
Date: Mon 14 Jan 85 15:58:24-PST
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: Course listing
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-4776
The shortened title for CS 226, which appears on student study lists
and transcripts is listed as "Epist Art Ing." Students have requested
that the truncated title be changed to "Epist Probs / AI."
I have made this suggestion to the Registrar's Office, and unless
you have an objection, it will be changed immediately.
Kathy
-------
∂14-Jan-85 2000 JMC*
Look at Rogers, take in extra.
∂14-Jan-85 2025 DEK backtracking
Here's an attempt to say more clearly what I was trying to formulate
in the corridor:
Suppose we want to find all solutions to some multistep problem.
It's clearly useful to be able to recognize "forced moves"
(e.g. in the queens problem, to fill the last remaining position in
a rank or file) and continue until no more such moves are left.
Now you are pointing out something important that I don't recall seeing
before (although I haven't checked my old notes): Suppose that, after all
forced moves are made, we look at all possible next moves. If any of these
leads to a contradiction (e.g., in the queens problem, if we find a rank
or file with no slots left; or --- more generally --- if we find such a
contradiction while following all forced moves that would follow from a
tentative move), then we eliminate the tentative move from consideration.
This elimination, in turn, can lead to additional forced moves and
eliminations. The key point (to me at least) is that we can eliminate all
such alternatives BEFORE deciding on what next move should really be taken
in the backtrack tree. The net result can be a substantial decrease in the
number of branches that actually need to be examined.
The idea is quite general, and I plan to apply it to a
heuristic search problem arising in circuit design that my CS204
students are doing. When I tested my program a couple weeks ago,
it ran very fast except in certain cases where I had to shut it off
after a half hour or so; I think by improving it to move elimination
as well as move forcing, the search might prove to be feasible after all.
∂14-Jan-85 2059 RPG Trip to Oregon
To: JJW@SU-AI.ARPA, cheriton@SU-PESCADERO.ARPA
CC: JMC@SU-AI.ARPA, CLT@SU-AI.ARPA
I was thinking of flying to Portland to check up on Sequent Jan 31.
I anticipated a technical presentation of Qlambda to them to get their
reaction on implementing it and to see whether they are real. Perhaps
some of you would like to go too. I was planning a 1-day trip.
-rpg-
∂15-Jan-85 0738 AI.WOODY@MCC.ARPA Re: AAAI sponsorship and help with conference
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 07:38:10 PST
Date: Tue 15 Jan 85 08:16:35-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Re: AAAI sponsorship and help with conference
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 14 Jan 85 13:45:00-CST
OK John, it sounds good to me from what you said.
-------
∂15-Jan-85 0751 SELKER@SU-SCORE.ARPA me
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 07:51:06 PST
Date: Tue 15 Jan 85 07:05:52-PST
From: Ted Selker <SELKER@SU-SCORE.ARPA>
Subject: me
To: jmc@SU-AI.ARPA, ejs@SU-AI.ARPA
I seem to need to show people that I have performed responsibly in working
job situations.
Could you draft a short note of recomendation for me.
Maybe you could mention that I have an active and inventive mind
(as you have told me)
Maybe you could mention that I took on an important and difficult project
as a service to the department and finished it.
It would make a great difference to me if you could do this.
Thankyou
Ted Selker
-------
∂15-Jan-85 0758 CL.BOYER@UTEXAS-20.ARPA more info
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 07:58:41 PST
Date: Tue, 15 Jan 1985 08:58 CST
From: CL.BOYER@UTEXAS-20.ARPA
To: John McCarthy <JMC@SU-AI>
Cc: cl.shankar@UTEXAS-20.ARPA
Subject: more info
In-reply-to: Msg of 10 Jan 1985 01:07-CST from John McCarthy <JMC at SU-AI.ARPA>
Unfortunately, our 2060 was down from 3pm Wednesday until 5 yesterday
(Monday). Therefore, our reply won't do you much good. But I'll
forward your message on to Shankar for a reply anyway.
∂15-Jan-85 0840 TAJNAI@SU-SCORE.ARPA Idaho
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 08:39:59 PST
Date: Tue 15 Jan 85 08:39:12-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Idaho
To: JMC@SU-AI.ARPA
John, EG&G Idaho is still very "hot". They just needed a bit more
justification; expect to know by next week.
Mr. Bertch asked is you had responded re being their liaison.
Did you and Carolyn decide you want a trip to Idaho?
Carolyn
-------
∂15-Jan-85 0945 RA message for MCCarthy
∂14-Jan-85 1805 TULEY@SU-SCORE.ARPA message for MCCarthy
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Jan 85 18:05:26 PST
Date: Mon 14 Jan 85 15:45:56-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message for MCCarthy
To: RA@SU-AI.ARPA
Hi Rutie,
Dave Fink, of Benelzore, would like to make an appointment with John McCarthy
for some time in the latter part of this week, Thursday after 2 or anytime
on Friday. (Says he knows John)
He will call you tomorrow to see if any arrangements have been made.
Bye - hope you had a fun afternoon off!
Kim
-------
∂15-Jan-85 0946 FISHER@SU-SCORE.ARPA Faculty Lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 09:46:07 PST
Date: Tue 15 Jan 85 09:44:35-PST
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: Faculty Lunch
To: faculty@SU-SCORE.ARPA
Faculty Lunch today at 12:15 in room 146 - topic is Undergraduate Computer
Education. We look forward to seeing you.
-------
∂15-Jan-85 1155 RA
I don't have an address for Ramo, shall I send it to the BULLETIN
and ask them to forward it?
∂15-Jan-85 1238 RA
Dave Fink would like to meet with you late Thursday or any time Friday,
when can you meet him. He'll call me later, so please let me know.
∂15-Jan-85 1305 CS.NOVAK@UTEXAS-20.ARPA AI Faculty
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 13:05:32 PST
Date: Tue 15 Jan 85 15:05:03-CST
From: Gordon Novak Jr. <CS.NOVAK@UTEXAS-20.ARPA>
Subject: AI Faculty
To: Feigenbaum@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
The CS dept at the University of Texas is seeking outstanding faculty
candidates in AI, especially at the Assistant Professor level. We have
a fine department and lots of equipment (about 60 Lisp machines of various
kinds, etc.), and lots of activity in nearly all areas of AI. If you can
refer any high-quality graduating students to us, I would greatly appreciate it.
(We have 17 open faculty slots, so send us all you have!)
Many thanks, Gordon
-------
∂15-Jan-85 1344 RA
Three letters on your desk for your signature
∂15-Jan-85 1358 RTC CS206
i1) I have Ben Fisk's final here: he got a total of 15 for the whole
final.
2) Could I get a copy of the grade sheet from you?
Ross
∂15-Jan-85 1418 CHEESEMAN@SRI-AI.ARPA Probability Workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 14:17:59 PST
Date: Tue 15 Jan 85 14:13:55-PST
From: P. Cheeseman <cheeseman@SRI-AI.ARPA>
Subject: Probability Workshop
To: aaai-office@SU-SCORE.ARPA, blum@SUMEX-AIM.ARPA, bledsoe@UTEXAS-20.ARPA,
buchanan@SUMEX-AIM.ARPA, cheeseman@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
fuzzy1@AIDS-UNIX.ARPA, georgeff@SRI-AI.ARPA, csd.grosof@SU-SCORE.ARPA,
jmc@SU-AI.ARPA, jeffery@SU-CSLI.ARPA, judea@UCLA-LOCUS.ARPA,
konolige@SRI-AI.ARPA, laws@SRI-AI.ARPA, lowrance@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, nilsson@SRI-AI.ARPA, pednault@SRI-AI.ARPA,
reboh@SRI-AI.ARPA, ruspini@SRI-AI.ARPA, sjg@SU-AI.ARPA, shore@NRL-CSS.ARPA,
shortliffe@SUMEX-AIM.ARPA
CALL FOR PARTICIPATION
"Workshop on Uncertainty and Probability in Artificial Intelligence"
Sponsored by: AAAI and IEEE
University of California, Los Angeles, California
August 14 through August 16, 1985
The workshop will explore the use of probabilities for decision
making in AI systems. In particular, topics such as the induction of
"theories" from uncertain data, coupling to decision theory, the
accuracy of probability values, and computerized "subjective"
probability estimation will be examined. Participants are encouraged to
submit papers or join the discussions on the following topics:
* Probabilistic Induction and Machine Learning
* Higher Order Probabilities (or accuracy of probabilities)
* Probabilities and "Subjective" Estimates (people and
machines)
* Techniques for Probability Evaluation
* Foundations of Probability Theory for AI
This workshop has been designed to provide an atmosphere which will
foster not only the exchange of information, but also extensive
discussion and participation by all involved.
Paper Submission Details
Authors should submit two copies of an extended abstract to the
program chairman by April 6 for consideration by the review committee.
Each copy should include a title, the names and addresses of all
authors, as well as a primary topic from the above list. One of the
authors should be identified as the principal contact. Acceptance will
be based on originality as well as significance of research
(Notification by April 27). Complete papers should be sent to the
general chairman by June 1 for distribution at the workshop.
Program Committee: Lotfi Zadeh Judea Pearl Laveen Kanal
Peter Cheeseman John Lemmer
Program Chairman: General Chairman: Arrangements Chairman:
John Lemmer Peter Cheeseman Rob Suritis
PAR Technology Corp. SRI International Par Technology Corp.
220 Seneca Turnpike 333 Ravenswood Ave. 220 Seneca Turnpike
New Hartford, NY 13413 Menlo Park, CA 94025 New Hartford, NY 13413
(315) 738-0600 x322 (415) 859-6469 (315) 738-0600 x233
-------
∂15-Jan-85 1440 BSCOTT@SU-SCORE.ARPA MS-AI Vote
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 14:40:18 PST
Date: Tue 15 Jan 85 14:22:10-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: MS-AI Vote
To: Faculty@SU-SCORE.ARPA
As you all know, the motion to approve the MS Program Committee's recommendation
to add Artificial Intelligence Theory to the CSMS program carried. However,
there was some confusion in recording both the motion action and the actual
vote. This was Margaret's first meeting and I should have helped her with
the count. Anyway, would the persons who made and seconded the motion please
confirm this action, and would the persons who were present and did vote
please let me know how you voted.
Thanks in advance,
Betty
-------
∂15-Jan-85 1537 RA
Craig LaGrow, editor of the magazine Computer Language would like to talk
to you. If you call in the next three hours call: (415) 851 4326. At any other
time call (415) 957 9353.
∂15-Jan-85 1537 RA Dave Fink
Fink called again to find out about getting together with you. It's
important. Please let me know. He'll call back tomorrow.
∂15-Jan-85 1543 CL.SHANKAR@UTEXAS-20.ARPA more info
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 15:43:05 PST
Date: Tue 15 Jan 85 17:44:15-CST
From: CL.SHANKAR@UTEXAS-20.ARPA
Subject: more info
To: JMC@SU-AI.ARPA
cc: cl.boyer@UTEXAS-20.ARPA
Dr. McCarthy:
Bob Boyer forwarded your msg. requesting info about
the mechanical proof of the Church-Rosser theorem to me. Here are
some answers to your questions. I am attaching an annotated list
of events in the proof which should answer a few of the questions.
There are about 34 events including definitions, induction hints,
a smattering of trivial lemmas and other fairly deep lemmas.
The machine proofs generated are, as far as I can see, the obvious
ones (some inductions were hinted). A combinatorial
explosion occurs in some of the base cases where the prover examines
some 50 sub-cases. Many of these are meant to show that certain
combinations of conditions do not arise. For this reason, the
generated proof is atleast 50-60 typed pages long but is in
my opinion quite readable.
It first occurred to me to attempt a proof of the theorem this
summer while I was in Cambridge, England. I sketched out a list
of events. The next step was when I actually started attempting
the proof on the Boyer-Moore prover in late October. I was running
into fairly serious problems with the normal Lambda Calculus notation
and Boyer suggested that I try the Debruijn notation (described below
in the second paragraph of the annotated list). I spent about 4 days
sketching out the proof using this notation. The actual machine proof session,
starting from scratch, (including writing up definitions, formulating
lemmas, locating counter-examples from abortive proof-attempts and
making revisions) took only 6 hours for the proof of the diamond
property for walks. The rest came fairly easily, and took about 2 hours.
I do not consider the proof (human or otherwise) to be easily understandable.
It took a 5 hour presentation in Boyer's weekly seminars to partially
convince others familiar with the theorem prover and its logic. There were
some objections to the notation and the formulation of the theorem, all
of which have since been settled by further mechanical proofs. That is
I showed that the normal lambda calculus notation can be translated
into the DeBruijn notation so that beta-reductions are preserved.
I am currently writing up a paper which describes the events in the
mechanical proof without going into the details of the proof itself.
The conclusions I draw are mainly about the efficacy of the Boyer-Moore
theorem prover as a high-level proof-checker and the DeBruijn notation,
which I believe to be the most suitable formal notation for quantifiers for
metamathematical proofs on a machine.
Finally, I'd like to thank you for your kind attention. If you have
any further questions, please send me a msg. at CL.SHANKAR@UTEXAS-20.
Shankar.
An annotated list of events in the proof of the Church-Rosser theorem:
The list of events can be broken down into:
1. a description of the preliminary lambda-calculus notions.
2. the definition of a walk.
3. the proof of the diamond property of walks.
4. defining a reduction sequence as a series of walks.
5. proving the diamond property for reduction sequences.
The claim is that step 5 represents the Church-Rosser theorem but
it is not entirely accurate. What is missing is a proof that any
single beta-reduction constitutes a walk, and that any walk can
be represented as a sequence of reductions. These are fairly
obvious and have also been mechanically proven. The events
below are indexed for easy reference. Event 1 puts the prover
in its initial state where it contains a small database of facts.
Terms in lambda-calculus (LC) are atoms, lambda-terms or applications.
Anything which isnt a lambda-term or an application is an atom.
Lambda-terms are represented by the one-argument shell LAMBDA.
A bound variable occurrence in a term is represented by a number.
If the number is 1, it is bound by the first LAMBDA surrounding it,
if it is 2, it is the second LAMBDA and so on. Applications are
represented by the shell COMB and (COMB X Y) represents X applied
to Y. This representation is borrowed from DeBruijn and (among other
nice properties) alpha-steps no longer belong in this representation.
1. (BOOT-STRAP)
2. (ADD-SHELL LAMBDA NIL LAMBDAP ((BODY (NONE-OF) ZERO)))
3. (ADD-SHELL COMB NIL COMBP ((LEFT (NONE-OF) ZERO) (RIGHT (NONE-OF) ZERO)))
Those bound variables (positive numbers) for which there is no corresponding
LAMBDA are said to be free-bound variables. The function BUMP, increments
the free-bound variables above a certain index by 1. (BUMP X 0) bumps
all the free-bound variables in X.
4. (DEFN BUMP
(X N)
(IF (LAMBDAP X)
(LAMBDA (BUMP (BODY X) (ADD1 N)))
(IF (COMBP X)
(COMB (BUMP (LEFT X) N) (BUMP (RIGHT X) N))
(IF (NUMBERP X) (IF (LESSP X N) X (ADD1 X)) X))))
The function SUBST below captures the notion of replacing all occurrences
of a free-bound variable in a term with another term in the context of
a beta-reduction. (SUBST X Y N) denotes the result of replacing all
occurrences of the variable N in X with Y. If X is a lambda-term, all
the free-bound variables in Y have to be bumped when substituting into
the body of X since they come within the scope of an additional LAMBDA.
Furthermore, since a LAMBDA is lost in going from (COMB (LAMBDA X) Y) to
(SUBST X Y 1) (which denotes the result of a beta-reduction), all the
free-bound variables must be decremented by 1. A careful study of the
definition of SUBST reveals that this does occur in the case when N is
initially 1.
5. (DEFN SUBST
(X Y N)
(IF (LAMBDAP X)
(LAMBDA (SUBST (BODY X) (BUMP Y 0) (ADD1 N)))
(IF (COMBP X)
(COMB (SUBST (LEFT X) Y N) (SUBST (RIGHT X) Y N))
(IF (NUMBERP X)
(IF (EQUAL X (FIX N)) Y (IF (LESSP N X) (SUB1 X) X))
X))))
A walk is intuitively a sequence of reductions which proceed in an inside-out
order. The function WALK applies a walk W to a term M. W is similar in structure
to M and if a (QUOTE B) occurs in W where there is a redex (a term of the form
(COMB (LAMBDA X) Y) ) in M, then that reduction
is carried out after all the internal reductions.
6. (DEFN WALK
(W M)
(IF (LAMBDAP M)
(LAMBDA (WALK W (BODY M)))
(IF (COMBP M)
(IF (AND (EQUAL (CADDR W) 'B)
(LAMBDAP (LEFT M)))
(SUBST (BODY (WALK (CAR W) (LEFT M)))
(WALK (CADR W) (RIGHT M))
0)
(COMB (WALK (CAR W) (LEFT M)) (WALK (CADR W) (RIGHT M))))
M)))
Event 7 is trivial one. Event 8 is an induction hint. Events 9 and 10 are also
quite trivial.
7. (PROVE-LEMMA LAMBDA-WALK
(REWRITE)
(IMPLIES (LAMBDAP M) (LAMBDAP (WALK W M))))
8. (DEFN BUMP-WALK-IND
(U M N)
(IF (LAMBDAP M)
(BUMP-WALK-IND U (BODY M) (ADD1 N))
(IF (COMBP M)
(IF (AND (EQUAL (CADDR U) 'B)
(LAMBDAP (LEFT M)))
(AND (BUMP-WALK-IND (CAR U) (LEFT M) N)
(BUMP-WALK-IND (CADR U) (RIGHT M) N))
(AND (BUMP-WALK-IND (CAR U) (LEFT M) N)
(BUMP-WALK-IND (CADR U) (RIGHT M) N)))
T)))
9. (PROVE-LEMMA LAMBDAP-BUMP (REWRITE) (IMPLIES (LAMBDAP X) (LAMBDAP (BUMP X N))))
10. (PROVE-LEMMA LAMBDAP-SUBST
(REWRITE)
(IMPLIES (LAMBDAP X) (LAMBDAP (SUBST X Y N))))
Event 11 is a fact about commuting BUMPs.
11. (PROVE-LEMMA BUMP-BUMP1
(REWRITE)
(IMPLIES (LEQ N M)
(EQUAL (BUMP (BUMP Y N) (ADD1 M)) (BUMP (BUMP Y M) N))))
Event 12 demonstrates one instance of how BUMP distributes over SUBST.
12. (PROVE-LEMMA BUMP-SUBST
(REWRITE)
(IMPLIES (LEQ M N)
(EQUAL (BUMP (SUBST X Y N) M)
(SUBST (BUMP X M) (BUMP Y M) (ADD1 N)))))
Event 13 is another induction hint.
13. (DEFN BUMP-SUBST-INDUCT
(X Y N M)
(IF (LAMBDAP X)
(BUMP-SUBST-INDUCT (BODY X) (BUMP Y 0) (ADD1 N) (ADD1 M))
(IF (COMBP X)
(AND (BUMP-SUBST-INDUCT (LEFT X) Y N M)
(BUMP-SUBST-INDUCT (RIGHT X) Y N M))
T)))
Event 14 is the other instance of how BUMP distributes over SUBST.
14. (PROVE-LEMMA BUMP-SUBST2
(REWRITE)
(IMPLIES (LESSP N (ADD1 M))
(EQUAL (SUBST (BUMP X (ADD1 M)) (BUMP Y M) N)
(BUMP (SUBST X Y N) M)))
((INDUCT (BUMP-SUBST-INDUCT X Y N M))))
Event 15 is another trivial lemma and Event 16 is yet another induction hint.
15. (PROVE-LEMMA BUMP-LAMBDAP
(REWRITE)
(IMPLIES (LAMBDAP X)
(EQUAL (BODY (BUMP X N)) (BUMP (BODY X) (ADD1 N)))))
16. (DEFN SUBST-INDUCT
(X Y Z M N)
(IF (LAMBDAP X)
(SUBST-INDUCT (BODY X) (BUMP Y 0) (BUMP Z 0) (ADD1 M) (ADD1 N))
(IF (COMBP X)
(AND (SUBST-INDUCT (LEFT X) Y Z M N)
(SUBST-INDUCT (RIGHT X) Y Z M N))
T)))
Event 17 is a significant fact about BUMP commuting with WALK.
17. (PROVE-LEMMA BUMP-WALK
(REWRITE)
(EQUAL (WALK U (BUMP M N)) (BUMP (WALK U M) N))
((INDUCT (BUMP-WALK-IND U M N))))
Event 18 is a simple fact stating that N does not occur as a free-bound variable
in (BUMP X N).
18. (PROVE-LEMMA SUBST-NOT-FREE-IN
(REWRITE)
(EQUAL (SUBST (BUMP X N) Y N) X)
((INDUCT (SUBST X Y N))))
The next three events, 19-21, are fairly trivial and 20 and 21 are needed to
"normalize" certain terms in the proof.
19. (PROVE-LEMMA NLISTP-WALK (REWRITE) (IMPLIES (NLISTP W) (EQUAL (WALK W M) M)))
20. (PROVE-LEMMA SUBST-LAMBDA
(REWRITE)
(IMPLIES (LAMBDAP X)
(EQUAL (BODY (SUBST X Y N))
(SUBST (BODY X) (BUMP Y 0) (ADD1 N)))))
21. (PROVE-LEMMA WALK-LAMBDA
(REWRITE)
(IMPLIES (LAMBDAP X)
(EQUAL (BODY (WALK U X)) (WALK U (BODY X)))))
The next lemma, event 22, is perhaps the most important one in the proof.
Roughly it shows how SUBST distributes over itself. The right-hand-side
denotes two successive substitutions and the left hand side denotes the
same substitutions exchanged in the ordering. This lemma might look like
a "kludge" but it definitely isn't one.
22. (PROVE-LEMMA SUBST-SUBST
(REWRITE)
(IMPLIES (AND (NUMBERP M)
(LESSP M (ADD1 N)))
(EQUAL (SUBST (SUBST X (BUMP Z M) (ADD1 N))
(SUBST Y Z N)
M)
(SUBST (SUBST X Y M) Z N)))
((INDUCT (SUBST-INDUCT X Y Z M N))))
The function SUB-WALK is the walk that results from substituting one
walk U into another W, where U walks N and W walks M.
23. (DEFN SUB-WALK
(W M U N)
(IF (LAMBDAP M)
(SUB-WALK W (BODY M) U (ADD1 N))
(IF (COMBP M)
(IF (AND (EQUAL (CADDR W) 'B)
(LAMBDAP (LEFT M)))
(LIST (SUB-WALK (CAR W) (LEFT M) U N)
(SUB-WALK (CADR W) (RIGHT M) U N)
'B)
(LIST (SUB-WALK (CAR W) (LEFT M) U N)
(SUB-WALK (CADR W) (RIGHT M) U N)))
(IF (NUMBERP M) (IF (EQUAL M (FIX N)) U W) W))))
Event 24 is the substitutivity of walks lemma.
24. (PROVE-LEMMA WALK-SUBST
(REWRITE)
(EQUAL (WALK (SUB-WALK W M U N) (SUBST M X N))
(SUBST (WALK W M) (WALK U X) N)))
Event 25 is a skolem function which generates the convergent walks needed
for the proof of the diamond property of walks.
25. (DEFN MAKE-WALK
(M U V)
(IF (LAMBDAP M)
(MAKE-WALK (BODY M) U V)
(IF (COMBP M)
(IF (AND (EQUAL (CADDR U) 'B)
(LAMBDAP (LEFT M)))
(SUB-WALK (MAKE-WALK (LEFT M) (CAR U) (CAR V))
(BODY (WALK (CAR U) (LEFT M)))
(MAKE-WALK (RIGHT M) (CADR U) (CADR V))
0)
(IF (AND (EQUAL (CADDR V) 'B)
(LAMBDAP (LEFT M)))
(LIST (MAKE-WALK (LEFT M) (CAR U) (CAR V))
(MAKE-WALK (RIGHT M) (CADR U) (CADR V))
'B)
(LIST (MAKE-WALK (LEFT M) (CAR U) (CAR V))
(MAKE-WALK (RIGHT M) (CADR U) (CADR V)))))
U)))
Event 26 asserts the diamond property of walks. If U and V walk M to
(WALK U M) and (WALK V M) respectively, then (MAKE-WALK M U V) and
(MAKE-WALK M V U) walk these back to the same conclusion.
26. (PROVE-LEMMA MAIN
(REWRITE)
(EQUAL (WALK (MAKE-WALK M U V) (WALK U M))
(WALK (MAKE-WALK M V U) (WALK V M))))
The function REDUCE applies a series of walks to term M.
27. (DEFN REDUCE (W M) (IF (LISTP W) (REDUCE (CDR W) (WALK (CAR W) M)) M))
Next we need to show the diamond property of REDUCE. For this we first show
that a divergent walk and a series of walks can be made to converge with a
series of walks and a walk, respectively. The function MAKE-WALK-REDUCE
generates the convergent walk, and MAKE-REDUCE-WALK generates the convergent
series of walks. Event 30 shows that a walk and a series of walks can be made
to converge.
28. (DEFN MAKE-WALK-REDUCE
(M W V)
(IF (LISTP V)
(MAKE-WALK-REDUCE (WALK (CAR V) M) (MAKE-WALK M (CAR V) W) (CDR V))
W))
29. (DEFN MAKE-REDUCE-WALK
(M W V)
(IF (LISTP V)
(CONS (MAKE-WALK M W (CAR V))
(MAKE-REDUCE-WALK (WALK (CAR V) M)
(MAKE-WALK M (CAR V) W)
(CDR V)))
NIL))
30. (PROVE-LEMMA WALK-REDUCE
(REWRITE)
(EQUAL (REDUCE (MAKE-REDUCE-WALK M W V) (WALK W M))
(WALK (MAKE-WALK-REDUCE M W V) (REDUCE V M))))
MAKE-REDUCE like MAKE-WALK is the skolem function which generates the convergent
series of walks.
31. (DEFN MAKE-REDUCE
(M U V)
(IF (LISTP U)
(CONS (MAKE-WALK-REDUCE M (CAR U) V)
(MAKE-REDUCE (WALK (CAR U) M)
(CDR U)
(MAKE-REDUCE-WALK M (CAR U) V)))
U))
32. (PROVE-LEMMA LIST-MAKE-REDUCE2
(REWRITE)
(IMPLIES (LISTP V)
(EQUAL (REDUCE (MAKE-REDUCE M U V) (REDUCE V M))
(REDUCE (MAKE-REDUCE (WALK (CAR V) M)
(MAKE-REDUCE-WALK M
(CAR V)
U)
(CDR V))
(REDUCE V M)))))
33. (PROVE-LEMMA LIST-MAKE-REDUCE3
(REWRITE)
(EQUAL (REDUCE (MAKE-REDUCE M U (CONS X Y))
(REDUCE Y (WALK X M)))
(REDUCE (MAKE-REDUCE (WALK X M)
(MAKE-REDUCE-WALK M X U)
Y)
(REDUCE (CONS X Y) M)))
((USE (LIST-MAKE-REDUCE2 (V (CONS X Y))))))
The Church-Rosser theorem as stated below asserts the diamond property
of series of walks.
34. (PROVE-LEMMA CHURCH-ROSSER
(REWRITE)
(EQUAL (REDUCE (MAKE-REDUCE M U V) (REDUCE V M))
(REDUCE (MAKE-REDUCE M V U) (REDUCE U M))))
-------
∂15-Jan-85 1808 ANDY@SU-SCORE.ARPA [Jonathan A Rees <JAR @ MIT-MC>: [CENT: proposed destruction of data on tape]]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 18:08:06 PST
Date: Tue 15 Jan 85 18:07:08-PST
From: Andy Freeman <ANDY@SU-SCORE.ARPA>
Subject: [Jonathan A Rees <JAR @ MIT-MC>: [CENT: proposed destruction of data on tape]]
To: jmc@SU-AI.ARPA
Since you're trying to keep an online copy all of the new papers written
at Stanford, I thought you might be interested in what is going to happen
to online copies of old MIT papers.
-andy
---------------
Return-Path: <JAR@MIT-MC>
Received: from MIT-MC by SU-SCORE.ARPA with TCP; Tue 15 Jan 85 17:05:10-PST
Date: 15 January 1985 20:05-EST
From: Jonathan A Rees <JAR @ MIT-MC>
Subject: [CENT: proposed destruction of data on tape]
To: andy @ SU-SCORE
You can forward this to JMC if you feel it's worthy.
- Jonathan
------
MSG: ALERT! ALARM!
Date: 01/04/85 01:23:02
From: CENT
Re: proposed destruction of data on tape
If you currently do or ever did have files on an ITS machine, you should
read CENT;LCS TAPES.
----- file CENT;LCS TAPES follows -----
The following articles were published in the "Fall 1984" issue of the
LCS newsletter, which was delivered to LCS offices recently. All
comments should, as requested, by directed to GRIEF@XX.
---------------------------------------------------------------------
Notice
Although ML and DM are no longer in use, racks of back-up tapes from
those machines are still being stored at LCS. Anyone who has hopes of
retrieving information from those tapes should try to do so by April
30, 1985. (Creativity may be required!) The tapes will not be kept
after that date.
We would like to take similar, but somewhat less drastic steps to
reduce the number of back-up tapes being stored for MC. Our hope is
to start recyling old MC back-up tapes so that we will store only
about 6 months of tapes at any one time. If this will create problems
for any of you, please contact Irene Greif (Greif@@XX). Meanwhile, we
encourage users to start writing archival files to tapes other than
the back-up tape. If you need help creating tapes, contact Tyrone
Sealy (Ty@@XX). Any suggestions for future management of MC back-up
and archiving are welcome!
----------------------------------------------------------------------
Long Term Information Storage At LCS
Depending on your "computer community" within LCS, your experience
with centralized support for long-term storage services will vary. If
you work primarily on a PC, you probably have learned the value of
backing-up files on floppy disks--the storage system is quite
unreliable and it's common to have to rely on back-up copies to
restore information. If you work on a single-user VAX, you may have
found back-up too burdonsome, taken some risks and been among those
who have lost months of work after a disk crash. On XX,@i[ back-up]
is done automatically for all users and loss of information is rare.
However, temporary loss of access to information can occcur due to
@i[migration] of infrequently used files to tape. This "service" is
performed to assure that on-line storage is always available for
current work. Occasionally, you may realize that you won't be
accessing an important file and will explicitly request that it be
moved to tape. This @i(archiving) service provides reliable long-term
storage.
On ITS machines, such as ML and MC, users have traditonally relied on
back-up tapes for archival storage. The ITS machine practice has
resulted in extravagant use of tapes: full system and incremental
dumps of all files for all time are still being stored in case they
contain archival information. This practice has carried over to XX:
despite the availability of archiving on XX, we have also saved all XX
back-up tapes. Confusion as to the distinction between migration and
archiving has also resulted in long-term storage of all migration
tapes.
During the next six months we will begin revamping our archiving and
back-up services. Our first step is to establish a sensible recycling
schedule for back-up tapes. These tapes are meant to protect against
loss of information due to catastrophic crashes. It should not be
necessary to keep old back-up tapes indefinitely--six months of tapes
is the number we are aiming at. Unfortunately, the ITS reliance on
back-up for archiving will be disrupted and new archiving practices
will have to be developed for the one remaining ITS machine, MC (See
notice, page 4). On XX, the change in back-up routine should have
little impact on users since none of the old back-up tapes has ever
been accessed.
Our second target is migration on XX. The current procedures for
migration and retrieval are not widely understood: files seem to
disappear just when they are needed and retrieval requests for whole
directories swamp Tyrone and delay service. We need suggestions from
XX users. Send messages to Greif@@XX or Ty@@XX.
Finally, we are experimenting with facilities for centralized back-up
and archival storage for users of PC's and other single user machines.
Most of the single user VAXes at LCS and some of the IBM PC's make use
of remote virtual disks (RVDs) to increase their storage capacity.
These disks can and should be backed-up automatically. A back-up
program for the PC disk is being written that will automatically
back-up RVD files and can optionally provide back-up and archive
locally stored files. We plan to provide a similar facility for
VAXes, to be implemented (we hope) in cooperation with Project Athena.
-------
∂15-Jan-85 1918 cha@mitre-bedford Bibliography and writeup on nonmonotonic reasoning
Received: from MITRE-BEDFORD.ARPA by SU-AI.ARPA with TCP; 15 Jan 85 19:18:12 PST
Date: Tuesday, 15 Jan 1985 22:18-EST
From: cha@Mitre-Bedford
To: jmc@su-ai
Cc: cha@Mitre-Bedford
Subject: Bibliography and writeup on nonmonotonic reasoning
Hi John,
I am taking advantage of the arpanet to request the bibliography and writeups
that you might have on non-monotonic reasoning. If you recall, I was
interested in them at the ASL meeting in Annaheim.
Please send them to me at:
Charles Applebaum
Department of Mathematics and Statistics
Bowling Green State University
Bowling Green, Ohio 43403
Thank you very much,
Charles Applebaum
∂16-Jan-85 0314 GROSOF@SU-SCORE.ARPA semantics and model theory for Default Logic- news
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Jan 85 03:14:00 PST
Date: Wed 16 Jan 85 03:12:41-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: semantics and model theory for Default Logic- news
To: konolige@SRI-AI.ARPA
cc: nilsson@SU-SCORE.ARPA, genesereth@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA,
grosof@SU-SCORE.ARPA, jjf@SU-SCORE.ARPA
Hi Kurt,
I was perusing your draft paper "Nonmonotonic Reasoning as Conjectures on
Partial Models". The following "review" may be helpful.
You may not be aware that Witold Lukaszewicz' "Considerations on Default
Logic) [Proc. AAAI Workshop on Nonmonotonic Reasoning, 1984] provides
a semantics, i.e. model theory, for default logic.
He gives it for his version of default logic which seems to be a
nice clean up of some of Reiter's problems with non-normal default
logic: he guarantees 1) existence of extensions; and 2)
semimonotonicity, for non-normal default theories. This is achieved
by enforcing the consistency conditions in non-normal defaults more
strongly (and I agree more reasonably) than Reiter does. Since his
revision of default logic only affects non-normal defaults, his
model theory applies to normal defaults a la Reiter as well as to
all defaults a la Lukaszewicz.
Just in passing, I think this is a fairly significant result which I and
probably many others have heretofore relatively ignored because the
paper is long and full of detail in typewriter font, and because the
author is in Poland, and did not present his paper at the Workshop.
Regards,
Benjamin
-------
∂16-Jan-85 0718 perlis@tove Re: non-monotonic bibliography
Received: from TOVE.ARPA by SU-AI.ARPA with TCP; 16 Jan 85 07:18:23 PST
Received: by tove.ARPA (4.12/4.7)
id AA01580; Wed, 16 Jan 85 10:20:12 est
Message-Id: <8501161520.AA01580@tove.ARPA>
To: John McCarthy <JMC@su-ai.ARPA>
Cc: perlis@tove
Subject: Re: non-monotonic bibliography
In-Reply-To: Your message of 15 Jan 85 1925 PST.
<8501160325.AA17556@maryland.ARPA>
Date: 16 Jan 85 10:20:04 EST (Wed)
From: Don Perlis <perlis@tove>
John, I will send you the bibliography as soon as I can get it back from
a tape; I no longer have it on line. It did appear at the end of the
bound preprints for the New Paltz/Mohonk workshop, in case you want to
look at it in a hurry. I also will send a hard copy to the address you
specified.
Did you get the copy of Kueker's little note I sent you, on a
coubterexample to circumscriptive completeness? He now has a more
detailed version which I will also forward (U.S. mail, he's not a
computer buff!). Jack and I are polishing our paper on circumscriptive
completness, which makes use of Kueker's example as well as delineates
many cases where completeness holds (we have proofs for the 1984 version
of (parameter) circumscription now), and we'll send you a copy soon.
Best regards,
--Don
∂16-Jan-85 0802 BARWISE@SU-CSLI.ARPA Jobs for Postdocs
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 16 Jan 85 08:01:14 PST
Date: Wed 16 Jan 85 07:55:59-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Jobs for Postdocs
To: Initiators@SU-CSLI.ARPA
cc: Emma@SU-CSLI.ARPA
As you may recall, the original plan was to have postdocs come for two
years. However, with budget cutbacks, we will not be able to do this,
even though they are a first-rate bunch of people. I explained the
financial situation to them when they arrived, and told them they
could apply for a second year, but should not count on it at all. I
think we should do all we can to help them find jobs. So please keep
them in mind as this year's job season goes into full swing.
-------
∂16-Jan-85 0902 WIEDERHOLD@SU-SCORE.ARPA CS Colloquium #3, Jan. 22nd MCC and Lattices
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Jan 85 09:02:02 PST
Date: Wed 16 Jan 85 08:48:18-PST
From: Gio Wiederhold <WIEDERHOLD@SU-SCORE.ARPA>
Subject: CS Colloquium #3, Jan. 22nd MCC and Lattices
To: ALL-COLLOQ@SU-SCORE.ARPA, SU-BBOARDS@SU-SCORE.ARPA, TULEY@SU-SCORE.ARPA,
FACULTY@SU-SCORE.ARPA, MILTON@SRI-AI.ARPA, MORGENSTERN@SRI-CSL.ARPA
cc: hassan@MCC.ARPA
CS 300 -- Computer Science Department Colloquium -- Winter 1984-1985.
Our third meeting will be on post-super-bowl
Tuesday, January 22, 1985
at 4:15 in Terman Auditorium
A LATTICE THEORETIC APPROACH TO COMPUTATION
BASED ON A CALCULUS OF PARTIALLY ORDERED TYPE STRUCTURES
Hassan AIT-KACI
Microelectronics and Computer Technology Corporation (MCC)
Austin, Texas
In this talk, I define a formal lattice-theoretic calculus of
partially ordered type structures where the ordering is meant to
reflect subtyping, and I propose a model of computation which amounts
to solving systems of simultaneous equations in a lattice of types.
The specific contributions which I believe to be original of the
research presented here are (1) an extrapolation of the syntactic
properties of first-order terms to provide insight in formalizing
record-like type structures; (2) a simple "types-as-sets" semantics
and a motivational discussion of what this entails for the operational
use of partially ordered types in programming; (3) in the light of the
foregoing discussion, a formal construction extending the proposed
calculus of record-like type structures to "variant" structures; (4)
an efficient algorithm to compute greatest lower bounds of type
structures; and (5) a particular language (KBL) based on solving recursive
equations in the lattice of types, and a fixed-point semantics study of its
model of computation.
-------------------------->
The talk will be preceded by a short introduction on the objectives and status
of MCC, a research organization jointly funded by many US computer companies.
-------------------------------->
Cookies, and if we can find a Juice-getting-volunteer, juice prior to the
colloquium, at 3:45 in the Margaret Jacks Hall Lounge.
---------------------------------------> see you there
-------
∂16-Jan-85 1117 RA
Please call John Nafeh, (56) 943 1711
∂16-Jan-85 1331 SG QLAMBDA or parallel processing
To: JMC
CC: SG
I expected to see you at your office about noon today.
Maybe I understood mistakenly when you told the schedule on Monday evening.
Is it possible to hear something about your parallel processing project?
One of my friend at NTT, Dr.Amamiya, got interested in QLAMBDA. I have already
sent a copy of your paper to him.
∂16-Jan-85 1348 RA
Kathy from AAAI office wanted to remind you about your notes to the
minutes from the executive committee. They would like to get it by
Monday, January 21.
∂16-Jan-85 1410 RA
Jan Komorowski from Harvard is in town at Xerox. He'll be here until the
end of the month. Would like to meet with you, maybe for lunch. His telephone
is 494 4855
∂16-Jan-85 1545 SSO.OWICKI@SU-SIERRA.ARPA [Olaf I. Henjum <O.OLAF@LOTS-C>: BTL interest in QLambda]
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 16 Jan 85 15:45:16 PST
Date: Wed 16 Jan 85 15:47:36-PST
From: Susan Owicki <SSO.OWICKI@SU-SIERRA.ARPA>
Subject: [Olaf I. Henjum <O.OLAF@LOTS-C>: BTL interest in QLambda]
To: rpg@SU-AI.ARPA, jmc@SU-AI.ARPA
This note, from a student who took a class with me, concerns someone
at Bell Labs who is interested in implementing Qlambda. I'm passing
it along in case you are interested.
Sue
---------------
Received: from LOTS-C by Sierra with Pup; Tue 15 Jan 85 22:17:33-PST
Date: Tue 15 Jan 85 22:14:34-PST
From: Olaf I. Henjum <O.OLAF@LOTS-C>
Subject: BTL interest in QLambda
To: owicki@Sierra
cc: o.olaf@LOTS-C
I just remembered something else about QLambda you might be interested in:
Between New Year's Day and the beginning of the quarter, I took (the
traditional Bell Labs OYOC) "conference trip" back to my "home" lab/department
at Indian Hill. While I was there the subject of my interim project with
QLambda came up, and it turns there's one person in my department who would
be VERY interested in finding out more about the QLambda language.
At the moment, one of his jobs is to find new software tools (including
languages) for the AI-related work of the "Software Automation Group" in
our department. He's particularly interested in whether there are any plans
to put QLambda on a real multi-processor computer, especially the HEP
architecture. It seems he has access to an experimental HEP machine
through his alma mater (De Paul, I believe). I don't understand exactly
what he has in mind, but it might be something like a possible joint
project to implement QLambda on a HEP machine. At least that's the initial
impression I got (beyond "this is fascinating; can you find out anything
else about it for me?").
Anyway, since Gabriel has apparently left Stanford (that's what I was told
when I tried to call him), I figured you might be the next logical person
to talk to about this.
If you want to get in touch with this other person, his name is Jay Usko
and he can be reached by telephone at (312) 979-2494 (I think; I'm not
sure because he joined the department after I came to Stanford, but
that number is the main departmental number, so it should work)
or through the arpanet by sending mail to "ihnp4!ihesa!jay"@berkeley.
--Olaf Henjum (henjum@score or o.olaf@lotsc)
-------
-------
∂16-Jan-85 1614 RA
Dave Fink is staying at the the Ricky's Hyatt 493 8000 room 2333. He is
meeting with Dick Gabriel at Lucid tomorrow at 10:00. Has a meeting at
Livermore Friday at 9:00.
∂16-Jan-85 1614 REGES@SU-SCORE.ARPA Faculty Senate
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Jan 85 16:12:34 PST
Date: Wed 16 Jan 85 16:10:52-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Faculty Senate
To: jmc@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
In case you hadn't noticed, I thought I'd point out that you are quoted in
today's Stanford Daily, summarizing your comments to the Faculty Senate last
week. You even got your picture in the paper! It's on the last page of
today's Daily.
I thought I'd also add my two cents worth. As I mentioned at the lunch on
Tuesday, there are already about 30 microcomputers in dorms. Ralph is putting
an additional 50 in dorms this quarter. Next year there will be 180 IBM PC's
put into dorms. These computers will certainly help to address the need for
word processing.
I agree completely with your pessimism, however. This big IBM deal, for
example, worries me (project RAMUS). We're getting something like $12 million
worth of equipment over the next few years. So far everyone seems to be
requesting PC's, because of the software that already runs on them. I think
this is a big mistake. IBM is not giving us computers to solve our long-term
educational problems, they are giving us old technology that will create a
long-term maintenance problem that we'll have to solve. The DEC stuff that
Ralph is offering is the same technology. All the vendors are offering the
same thing: equipment only, no money for software development or for
maintenance.
I had an inkling of these attitudes when I attended a meeting to discuss the
possibility of designing an "interactive classroom" that will provide "the
teaching environment of the future." They plan to put IBM PC's in it. I
mentioned the possibility of using high-end equipment in order to avoid
absolesence (as Brown has done), but the response was, "We want something that
has software already written for it."
-------
∂16-Jan-85 1652 RA Carolyn
Carolyn missed her connecting flight. Will take Continental 197 which
is supposed to come in at 10:00. It leaves Houston at 8:00 (Houston time).
You should check though before you leave to the airport.
∂16-Jan-85 2124 CL.SHANKAR@UTEXAS-20.ARPA Corrections in the annotation
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 16 Jan 85 21:24:36 PST
Date: Wed 16 Jan 85 23:28:29-CST
From: CL.SHANKAR@UTEXAS-20.ARPA
Subject: Corrections in the annotation
To: JMC@SU-AI.ARPA
cc: CL.SHANKAR@UTEXAS-20.ARPA
Dr. McCarthy:
there is a mismatch between the description and actual input to the
theorem prover in the annotated list of events in the Church-Rosser theorem
proof I sent you yesterday. The changes to the description are:
1. bound variables are represented by all natural numbers instead of just
the positive ones. So, in the DeBruijn notation described, if the index
of the bound variable is 0, it is bound by the first LAMBDA surrounding it.
2. Correspondingly, a beta-reduction of a redex (COMB (LAMBDA X) Y) is
carried out by (SUBST X Y 0) instead of (SUBST X Y 1).
I have two versions of the proof and things got mixed up. I hope you
found the information useful.
Shankar
-------
∂17-Jan-85 0129 DAVIES@SUMEX-AIM.ARPA HPP Architecture Meeting, Wed. 1/23., 9 am
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 01:29:01 PST
Date: Thu, 17 Jan 1985 01:12 PST
Message-ID: <DAVIES.12080220386.BABYL@Sumex>
From: DAVIES@Sumex
To: JMC@SAIL
Subject: HPP Architecture Meeting, Wed. 1/23., 9 am
cc: Davies@Sumex, Feigenbaum@Sumex
The HPP Architecture Group would very much like to have you come next
Wednesday morning to talk about multiprocessor Lisp implementations.
The meeting begins at 9 am, and generally runs till 10:00 or 10:30.
Can you make it?
-- Byron
∂17-Jan-85 0236 ARK@SU-SCORE.ARPA Joe Halpern
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 02:36:45 PST
Date: Thu 17 Jan 85 02:35:57-PST
From: Arthur Keller <ARK@SU-SCORE.ARPA>
Subject: Joe Halpern
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA, Reges@SU-SCORE.ARPA, ARK@SU-SCORE.ARPA
My understanding is that you "own" half of MJH 302 and CSD owns the other
half. We are planning on putting Joe Halpern in the CSD half of MJH 302.
Please let me know if this is a problem, and that the space really is vacant.
We figure that the proximity to your group should be advantageous. Thanks.
Arthur
-------
∂17-Jan-85 0851 LEIB@SU-SCORE.ARPA Agree
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 08:51:33 PST
Date: Thu 17 Jan 85 08:50:53-PST
From: Rita Leibovitz <LEIB@SU-SCORE.ARPA>
Subject: Agree
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-4223
John, I saw the article on the last page of the Daily yesterday and I agree
with what you say. Good for you for speaking up. YOU must take a better
picture to place in the papers, the one in yesterdays rag was not your best...
but, I still love your neckties.
Rita
-------
∂17-Jan-85 1011 FIKES@USC-ECL.ARPA re: AAAI Executive Council Minutes
Received: from USC-ECL.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 10:10:45 PST
Date: Thu 17 Jan 85 10:06:27-PST
From: Richard Fikes <FIKES@USC-ECL.ARPA>
Subject: re: AAAI Executive Council Minutes
To: JMC@SU-AI.ARPA
cc: FIKES@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 16 Jan 85 19:33:00-PST
John,
Thanks for the observation about the length of the president's
term. We will check the by-laws. In the section of the minutes on
the workshops, I would like to include a sentence or two reporting
on the workshops that occured priori to the meeting in August. As
I remember, you mentioned them in your report, but I did not write
anything in my notes on them. Could you suggest a couple of appropriate
sentences?
thanks,
richard
-------
∂17-Jan-85 1012 @MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet new generation systems?
Received: from MIT-MULTICS.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 10:11:51 PST
Received: from UMich-MTS.Mailnet by MIT-MULTICS.ARPA with Mailnet id <2652285374894453@MIT-MULTICS.ARPA>; 17 Jan 1985 12:56:14 est
Date: Thu, 17 Jan 85 12:27:26 EST
From: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <611753@UMich-MTS.Mailnet>
Subject: new generation systems?
The latter is the closest. The topic is really there for the Japanese to
give their version of what the next generation looks like (a la their
Fifth Generation Project). The opportunity for the US speaker (you) is
to give a US view of where such systems are going, such as Lisp on parallel
macines, etc., and even some futuristic stuff, but not too way out - i.e.,
it should be credible to compete with their ongoing project. Is this ok?
∂17-Jan-85 1137 RA
1. Your were asked not to turn off the light tower again. They need to do
some testing tonight.
2. Craig LaGrow from Computer Language called again (415) 957 9353
3. Nils Nilsson needs to get in touch with Chris Goad, do you know where he
is nowadays.
∂17-Jan-85 1137 RA Dave Fink
Dave called this morning. Imperative that he talks to you. He is going to
meet with Chuck Buffalano (DARPA) next week and needs to talk to you before
he talks to him. The subject of DENELCOR is going to come up.
∂17-Jan-85 1404 RA
Kathy Aparicio from Calif. Times Radio would like a short interview with
you next week (415) 547 7392. If she calls, what shall I tell her?
∂17-Jan-85 1451 RA
Marc LaBrun called. He can get you the software you wanted for free with the
following conditions:
1. It must be for your own use
2. You have to sign an ordinary license agreement.
He will get back to you with some more details. His telephone 494 8081.
∂17-Jan-85 1607 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 16:07:33 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 17 Jan 85 16:00:45-PST
Date: Thu 17 Jan 85 16:05:00-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
There will be no F4 meeting on Monday, Jan. 21, due to Stanford's
observance of Martin Luther King Day. The next F4 meeting will be on
Monday, Jan. 28 at 1:15 in the Ventura conference room. Stan
Rosenschein will give a presentation on robot design. Background
reading is "Shakey the Robot" by Nils Nilsson. Copies have been
placed in the Ventura reading room.
-------
∂17-Jan-85 1611 AAAI-OFFICE@SUMEX-AIM.ARPA Conversation with Jenks
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 16:11:15 PST
Date: Thu 17 Jan 85 14:21:18-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Conversation with Jenks
To: JMC@SU-AI.ARPA, ai.woody@MCC.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I just talked to Dick Jenks and we discovered he wants to hold
his conference the same time as ours in '86 - August 10-16.
We discussed as alternate plan to have his conference the
week before the International Conference. He will be checking
with his co-chair about this suggestion. I told him
I would be more than happy to help him facilitate his conference,
and he was appreciative of the offer.
-Claudia
-------
∂17-Jan-85 1647 LB@SU-CSLI.ARPA February 7 Colloquium
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 16:47:02 PST
Date: Thu 17 Jan 85 16:41:09-PST
From: peters
Subject: February 7 Colloquium
Sender: LB@SU-CSLI.ARPA
To: initiators@SU-CSLI.ARPA
Reply-To: to Lauri@su-csli or Peters@su-csli
TEL: (415) 497-9007
Anna Szabolcsi from the MIT Center for Cognitive Science is planning
to come to California in February. While she is out here she would like
the opportunity to give a talk at CSLI. The title of her talk will be
``Definiteness Effect and Superlative''. Approximately $250 would be
needed for her expenses.
Is anyone interested in sponsoring Ann Szabolcsi?
-------
∂17-Jan-85 1659 RESTIVO@SU-SCORE.ARPA Advice sought
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 16:59:38 PST
Date: Thu 17 Jan 85 16:58:48-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: Advice sought
To: JMC@SU-AI.ARPA
cc: Restivo@SU-SCORE.ARPA
[cwr] I received a letter today from the Office of Graduate
Admissions regarding the status of my application
to the Computer Science Department.
It seems as though my application has died the pre-screening
admission process death, the lack of a Bachelor's degree
seems to have ended further processing of the application.
Is there a course of action you might suggest that could
be pursued to further consideration of my application?
If there exists a chance in hell of resurection I would
be happy to pursue that chance. To phrase it woodenly,
I'd exchange my left testicle to actively contend for
a slot in the program at Stanford.
Thank you for any advice about this.
The text of the letter:
1.15.85
Dear Mr. Restivo:
We have received your application for graduate study in the
Department of Computer Science. However, we note that you have
completed only 84.5 quarter units of undergraduate work at
Foothill College and that does not entitle you to apply for
graduate standing at Stanford University.
Your $40. application fee will be refunded through our Cashier's
office and your application will be put in our inactive files. If you
complete a Bachelor's degree in the future we would be happy to
receive an application from you at that time should you still be
interested in doing graduate work at Stanford.
Sincerely,
Lynette N. Hall
Assistant Dean of
Graduate Studies
-------
∂17-Jan-85 1759 JJW Trip to Sequent
To: RPG
CC: JMC, CLT
I'd be happy to go along on the trip to Sequent in Portland, as long as
someone pays my way as was done for the Delencor trip.
∂17-Jan-85 1843 EJS ok
thankyou, thankyou, thankyou
∂17-Jan-85 1913 FIKES@USC-ECL.ARPA re: AAAI Executive Council Minutes
Received: from USC-ECL.ARPA by SU-AI.ARPA with TCP; 17 Jan 85 19:08:13 PST
Date: Thu 17 Jan 85 19:04:37-PST
From: Richard Fikes <FIKES@USC-ECL.ARPA>
Subject: re: AAAI Executive Council Minutes
To: JMC@SU-AI.ARPA
cc: FIKES@USC-ECL.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 17 Jan 85 10:59:00-PST
Ok. Thanks. I will put something together with Claudia.
richard
-------
∂17-Jan-85 2123 RPG
∂05-Jan-85 1403 JMC good words for DARPA
To: RPG, JJW, YOM
I need some. RPG's should cover PW's work as well as his own.
84arpa[1,clt] is plenty. Half that should suffice.
Put it in the third person.
Qlambda
: Overview
The Qlambda project was undertaken as part of the Common Lisp work at Stanford
and also as part of the feasibility study for the Advanced Architectures
Project at HPP. It's goal is to extend Common Lisp by adding parallel processing
constructs.
: Objectives
Qlambda is an extension of Common Lisp which provides multi-processing
capabilities. Qlambda supports a variety of parallel programming styles,
including parallel argument evaluation and message-passing. It is designed
to be implementable on a variety of multi-processor architectures.
: Approach
The approach has been to write a detailed simulator for Qlambda to
simulate behavior of Qlambda programs on a multi-cpu, shared-address-space
computer. With this simulator it has been possible to write a number
of programs in Qlambda and explore the speedups attainable under varying machine
characteristic parameters.
: Current Status
The basic Qlambda extensions have been defined and are available in the
report ``Queue-based Multi-processing Lisp,'' by Richard P. Gabriel and
John McCarthy, available as a Stanford University Computer Science Report.
The simulator runs in MacLisp under TOPS-20 and in Common Lisp on the
Symbolics 3600.
Several programming techniques have been defined and demonstrated in Qlambda.
These techniques will be described later.
: Important Contributions
The most important contributions of the Qlambda project have been to define
parallel programming techniques. There have been two major techniques
explored: software pipelining and geometric control structures.
Software pipelining is breaking a serial program into stages and mounting
the stages on different processors. The technique includes mechanisms for
maintaining global variables among the stages. That is, if the original
program contained global variables which were used to pass information
between subsequent calls to the program, it is still possible to pipeline the
program and achieve a significant speedup. This technique is useful for
parallelizing globally-shared data structures by streaming update and
access requests through the code which maintains the data structures
in question.
Geometric control structures are a technique for matching the `architecture'
of a problem solution to the architecture of the underlying machine.
Suppose that the problem solution calls for a hexagonal grid of processors
where each processor talks to six neighbors. A geometric control structure
is a hexagonal data structure where each node in the data structure is a
process (rather than a processor), and processes communicate with
other processes along the data-structure-defined paths to its six neighbors.
If a data structure containing processes can be mapped onto a physical
multi-processor so that the lines of communication defined by the data
structure map onto lines of communication defined by the architecture,
then the running speed of the solution program will be good. And even on
general multi-processors which do not match the data structure well there
will usually be significant speedup.
We sometimes refer to geometric control structures as `soft architectures.'
The key idea behind this technique is that it allows the programmer to
solve his problem in an architecture well-suited to his problem and its
solution.
Portable Common Lisp
: Overview
This project is to provide a portable Common Lisp implementation available
to DARPA contractors. The key to the project is to develop a high-quality
Lisp compiler which can be ported easily to various machines. Because
Common Lisp is the prefered Lisp for Strategic Computing work, the availability
of Common Lisp on a variety of machines is essential.
: Objectives
The first objective of the project is a Common Lisp compiler. This compiler
is to be largely table-driven or to have relatively small parts that are
machine-dependent. The second objective is to provide a Lisp-in-Lisp-style
Lisp implementation, which is then compiled on the various machines.
In addition, there is a corpus of code written in Common Lisp, which could
be useful to several projects, and which exists at particular sites. A second
goal of this work is to create a library of such useful programs along with
good documentation.
: Approach
The approach is to start with the ideas in the S-1 Lisp, especially the compiler,
and to build a subset of Common Lisp for the SUN II workstation. This is a
popular and fairly powerful workstation. The subset is to be small enough to
run well on a SUN workstation with a small physical memory and perhaps a small
available address space. That is, the implementation is geared towards being
usable on a mobile robot with a small MC68000-based machine on-board.
There is a problem with this approach, which is that there remains a significant
amount of machine-dependent code to be written on each port, even though the
its fraction of the total amount of code in the implementation is quite small.
: Current Status
Currently there is a subset of Common Lisp that runs on the SUN II under the
V kernel, a Stanford operating system similar to Unix. The code is available
on magnetic tape, and several copies have been sent to various institutions.
∂17-Jan-85 2131 RPG
∂17-Jan-85 1235 JMC
Who is this Dave Fink?
Fink is the assistant to the president of Denelcor. He negotiates
with the national labs. He made an appointment with me the other
day out of the blue and showed up today expecting 3 hours. He had the local
Denelcor representative with him.
The upshot was that he believes that as of last week Kahn is out of the
Strategic Computing picture, as is Ohlander. He told me that the `DARPA
higher-ups' with whom Denelcor had greased the skids was Buffalano.
Buffalano is right under Cooper. Fink said that Buffalano was prepared
to sign off on your proposal as soon as it arrived with the Denelcor
name in it.
He went on to explain the NSA's interest in Qlambda and the possibility
of additional sweetener to the deal for me from NSA.
I took his purpose to be influence peddling and politics. He wanted
to know where the proposal sat. I believe he came to the Bay Area
with other business calls to make. He said he was going back to
DARPA next week to find out their thinking.
Do you know how LES is doing with the first draft? I've sent him my part,
but have not heard what's happening.
About Fateman, I'm not sure what he brings to the table because there was
not much technical discussion. I'd rather get some `consulting' time from
him rather than pay his students to do random things for 3 years.
Perhaps when he sends his prose to LES we will be able to judge
what he might have in mind.
-rpg-
∂18-Jan-85 0705 @MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet re: new generation systems?
Received: from MIT-MULTICS.ARPA by SU-AI.ARPA with TCP; 18 Jan 85 07:05:40 PST
Received: from UMich-MTS.Mailnet by MIT-MULTICS.ARPA with Mailnet id <2652360436904246@MIT-MULTICS.ARPA>; 18 Jan 1985 09:47:16 est
Date: Fri, 18 Jan 85 08:44:08 EST
From: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <612826@UMich-MTS.Mailnet>
Subject: re: new generation systems?
John - I want you. I'm not really conbcerned with US main projects. I think
what we want in this seminar is a discussion of the state of the art, achievable
goals, reasonable strategies for the future, and educational and government
policies to encourage success. I think "blue sky" may be closer to what I had
in mind, but reasonable blue sky, for credibility. Therefore, the Lisp project
could serve as an example, but details would not be appropriate. I think you
have a good sense of where the field is going, and that's what I'm looking for.
Does that make sense to you?
∂18-Jan-85 0904 OHLANDER@USC-ISI.ARPA re: Program Summary
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 18 Jan 85 09:03:57 PST
Date: 18 Jan 1985 12:04-EST
Sender: OHLANDER@USC-ISI.ARPA
Subject: re: Program Summary
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <[USC-ISI.ARPA]18-Jan-85 12:04:45.OHLANDER>
In-Reply-To: The message of 30 Nov 84 1531 PST from John McCarthy <JMC@SU-AI.ARPA>
John,
I still have not received the summary of your program research.
Have you sent it? I need it as soon as possible for our report.
Ron
∂18-Jan-85 1020 @SU-CSLI.ARPA:PCOHEN@SRI-AI.ARPA [Phil Cohen <PCOHEN@SRI-AI.ARPA>: Next Tues.]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Jan 85 10:20:38 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 18 Jan 85 10:15:20-PST
Date: Fri 18 Jan 85 10:19:18-PST
From: Phil Cohen <PCOHEN@SRI-AI.ARPA>
Subject: [Phil Cohen <PCOHEN@SRI-AI.ARPA>: Next Tues.]
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
If you're interested, please come...
Phil
---------------
Mail-From: PCOHEN created at 18-Jan-85 10:08:10
Date: Fri 18 Jan 85 10:08:10-PST
From: Phil Cohen <PCOHEN@SRI-AI.ARPA>
Subject: Next Tues.
To: NL4: ;
I'm on tap for giving a "working", technical talk about the
speech acts formalism Hector and I are working on.
The topic will be how to ground speech act theory in rationality,
but we'll probably spend most of our time on rationality.
12:45 - 2:30, Ventura conf. room.
Phil
-------
-------
∂18-Jan-85 1023 CLT rpg
I have sent rpg a msg asking if he will be on campus soon,
saying that you would like the three of us to chat a little.
∂18-Jan-85 1045 RA
John Hurd called, wanted to let you know he got the project started
∂18-Jan-85 1115 RA
Joe Kearney from University of Iowa called to invite you to participate
in a Colloquium in the Spring term (April or May). Possible topic: Logic
& AI. His telephone (319) 353 5917.
∂18-Jan-85 1347 NILSSON@SU-SCORE.ARPA IBM Grant
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Jan 85 13:47:10 PST
Date: Fri 18 Jan 85 10:03:54-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: IBM Grant
To: faculty@SU-SCORE.ARPA
Last year, IBM gave the CSD a gift of $25,000 ("on the basis
of its excellence in computer science research.")
Quoting from Ralph Gomory's letter accompanying the check:
"The purpose of this grant program is to provide support for
outstanding university departments doing reseach in areas of
particular interest to IBM. We ask that these funds be used for the
initiation of new research, hiring of untenured faculty, the purchase
of scientific equipment--other than computer hardware or software--or
for the development of new courses."
I see that this grant money has not yet been committed to the
purposes IBM has specified. I am open to suggestions from the
faculty for how the funds might be used. A paragraph or two
ought to do. I'd like to decide soon.
Also quoting from the letter:
"If you accept this grant [we have already thanked IBM and accepted],
please send by June 1, 1985, a letter reporting specifically on how
the grant was used. This grant is renewable for a maximum of two
additional years."
Whoever suggests the best use will also, of course, get to write
the draft letter to IBM talking about how it was or is being used.
Thanks, -Nils
-------
∂18-Jan-85 1457 SJG discussion
I'll next be here Wednesday, unless we bump into one another over the
weekend. My apologies for being so damn busy ...
Matt
∂18-Jan-85 1810 YOM
A draft of the report is in 84arpa[1,yom]. -y
∂18-Jan-85 1833 YOM
I just FINGERed jjw and saw that he is going skiing for the week as of tomorow. You might try catching him at home today. -y
∂18-Jan-85 2026 JJW DARPA
∂18-Jan-85 1838 JMC
How about a paragraph tonight for DARPA on your activities.
JJW - I've put some text into the file DARPA[1,JJW]. Tell me if
you think it needs any changes.
∂19-Jan-85 0900 JMC*
Reddy
∂19-Jan-85 1512 YOM
There are now fewer typos in 84arpa[1,yom]. -yom
∂19-Jan-85 1737 LLW@S1-A.ARPA Foot-Dragging
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 19 Jan 85 17:37:18 PST
Date: 19 Jan 85 1714 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Foot-Dragging
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂19-Jan-85 0113 JMC@SU-AI.ARPA
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 19 Jan 85 01:13:15 PST
Date: 19 Jan 85 0135 PST
From: John McCarthy <JMC@SU-AI.ARPA>
To: llw@S1-A.ARPA
Still no word from DOE.
[John: I'll hassle them some more this coming week--the guy who handles these
matters in the Lab was out this past week, and he's due to ring me back
on Tuesday. Lowell]
∂20-Jan-85 0000 JMC*
energy.2
∂20-Jan-85 1253 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jan 85 12:52:53 PST
Date: Sun 20 Jan 85 12:52:15-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
With particular types of common sense identified as of concern
to us, how are we supposed to go about determining their nature?
Perhaps I just do not know about it but is there a systematic
methodology for checking what has been done as commonsensical?
I want to find out more about the Commonsense Summer. Who can
tell me more?
-------
∂20-Jan-85 1437 GOLUB@SU-SCORE.ARPA Forsythe Lectures
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jan 85 14:37:40 PST
Date: Sun 20 Jan 85 14:30:22-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Forsythe Lectures
To: Phd@SU-SCORE.ARPA
ReSent-Date: Sun 20 Jan 85 14:31:45-PST
ReSent-From: Gene Golub <GOLUB@SU-SCORE.ARPA>
ReSent-To: faculty@SU-SCORE.ARPA
The George and Sandra Forsythe Lectures will be given by J Alan George
the week of Jan 28. Alan is the Dean, Faculty of Mathematics at the
University of Waterloo. He graduated from Stanford in 1971 and was one
of Forsythe's last students.
He'll speak on Monday, Jan 28 in Math 380C at 3:30 on "Linear
Equations and Sparse Factorizations".A more general talk will be given
on Wednesday, Jan 30 in Terman Auditorium at 7:30 pm. The title is
"Solution of Large Sparse Systems of Equations". A reception follows
his Wednesday lecture at the Faculty Club.
GENE GOLUB
-------
-------
∂20-Jan-85 2033 DAVIES@SUMEX-AIM.ARPA HPP visit
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Jan 85 20:32:52 PST
Date: Sun, 20 Jan 1985 20:31 PST
Message-ID: <DAVIES.12081217814.BABYL@Sumex>
From: DAVIES@Sumex
To: JMC@SAIL
Subject: HPP visit
cc: Davies@Sumex
Tuesday at 10 is under consideration at this end. Would that still be
acceptable for you?
-- Byron
∂21-Jan-85 1255 DAVIES@SUMEX-AIM.ARPA HPP Visit
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Jan 85 12:55:43 PST
Date: Mon, 21 Jan 1985 12:54 PST
Message-ID: <DAVIES.12081396752.BABYL@Sumex>
From: DAVIES@Sumex
To: JMC@SAIL
Subject: HPP Visit
cc: Davies@Sumex
It looks like we're going to have a meeting tomorrow, Tuesday, January
22 at 10 am.
The topic of discussion, of course, is multiprocessor Lisp
implementations. In particular, we'd like to find out your current
thoughts on QLambda and possible hardware. If time allows, we'll
describe some of the ideas that we've been working on over here, and
then I hope we'll have a good discussion as a prelude to closer
interaction in future.
See you tomorrow.
-- Byron
∂21-Jan-85 1515 DAVIES@SUMEX-AIM.ARPA McCarthy visit -- Tuesday, January 22, 10 am
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Jan 85 15:15:26 PST
Date: Mon, 21 Jan 1985 15:13 PST
Message-ID: <DAVIES.12081422075.BABYL@Sumex>
From: DAVIES@Sumex
To: Brown@Sumex, Delagi@Sumex, Feigenbaum@Sumex, Rindfleisch@Sumex,
Aiello@Sumex, SHahn@Sumex, Schoen@Sumex, Saraiya@Sumex,
VSingh@Sumex, Yan@Sumex, Davies@Sumex, Nii@Sumex, RPG@SAIL
Subject: McCarthy visit -- Tuesday, January 22, 10 am
cc: JMC@SAIL, CLT@SAIL
John McCarthy will be coming to talk with the HPP Architecture Group
at 10 am Tuesday. The topic of discussion is multiprocessor Lisp
implementations. John will tell us his current thoughts on QLambda
and on multiprocessor hardware for QLambda. We will give John a brief
update on activities over here, as well.
The location of the meeting is the Welch Road conference room.
The meeting is hereby scheduled to end at 11:30, but the conference
room is reserved for longer in case the discussions get interesting
and technical.
-- Byron
∂22-Jan-85 0900 JMC*
cancel dentist
∂22-Jan-85 0921 NILSSON@SU-SCORE.ARPA Lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Jan 85 09:20:27 PST
Date: Tue 22 Jan 85 09:16:40-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Lunch
To: faculty@SU-SCORE.ARPA
12:15 lunch topic today: CSD admissions policies.
We have expanded the amount of lunch ordered since the
number of people attending has grown a bit. -Nils
-------
∂22-Jan-85 1050 komorowski.pa@Xerox.ARPA Visit
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 22 Jan 85 10:50:23 PST
Received: from Salvador.ms by ArpaGateway.ms ; 22 JAN 85 10:50:14 PST
Date: 22 Jan 85 10:45 PST
From: komorowski.pa@XEROX.ARPA
Subject: Visit
To: JMC@SU-AI.ARPA
cc: komorowski@HARVARD.ARPA
Many thanks for your invitation to join the lunch. It was quite a treat,
both an intelectual and a gourmet one. The discussions with you and with
Nils which followed the lunch were very interesting too. Once I am back
in Cambridge I shall try to spent some more time on the introspection in
Prolog.
Regards,
JK
∂22-Jan-85 1152 SHAHN@SUMEX-AIM.ARPA Re: no mtg next Wed
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 22 Jan 85 11:52:25 PST
Date: Tue 22 Jan 85 11:50:23-PST
From: Sam Hahn <SHahn@SUMEX-AIM.ARPA>
Subject: Re: no mtg next Wed
To: NII@SUMEX-AIM.ARPA
cc: Feigenbaum@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA, Delagi@SUMEX-AIM.ARPA,
RPG@SU-AI.ARPA, Aiello@SUMEX-AIM.ARPA, Saraiya@SUMEX-AIM.ARPA,
Yan@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA, Davies@SUMEX-AIM.ARPA,
Schoen@SUMEX-AIM.ARPA, Vsingh@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
shahn@SUMEX-AIM.ARPA
In-Reply-To: Message from "Penny Nii <NII@SUMEX-AIM.ARPA>" of Thu 17 Jan 85 09:25:47-PST
In reference to comments made at this morning's meeting, I'd like to
describe how thinking in a message-passing way leads to benefits which
look exploitable (to me).
Messages necessarily are queued as asynchronous objects perform their
tasks and communicate with each other. A message queue then becomes
not only the data structure containing scheduling information for a
particular process or object, but it becomes also a data structure
with information regarding how "busy" that process or object will be.
In a pipelined system where one such busy object becomes the
bottleneck, further attempts at design-time specification of object
"size" or busyness may be misguided, so long as this one bottleneck
isn't recognized. Access by the object itself to the object's message
queue at least raises the possibility that the object detect the busy
condition, or at least a bottleneck condition. This detection could
be accompanied by a replication of itself, either through direct
cloning, or through clone-plus-(entry and exit objects), where we may
assume the entry and exit objects do not become bottlenecks, but are
simply there to redirect the messages to/from the clones.
Separate issue: What do you feel about setting up a technical
bboard-like file, say, in <xage>architecture.txt? I'll put this
message there, and see if anyone responds to it. If people use it, we
may be able to get an address for it.
-- sam
-------
∂22-Jan-85 1232 U-REDDY@UTAH-20.ARPA Integers puzzle
Received: from UTAH-20.ARPA by SU-AI.ARPA with TCP; 22 Jan 85 12:32:48 PST
Date: Tue 22 Jan 85 13:33:57-MST
From: Uday Reddy <U-REDDY@UTAH-20.ARPA>
Subject: Integers puzzle
To: PROLOG@SU-SCORE.ARPA
cc: U-REDDY@UTAH-20.ARPA, jmc@SU-AI.ARPA, kuo@SU-AI.ARPA
In-Reply-To: Message from "Chuck Restivo (The Moderator) <PROLOG-REQUEST@SU-SCORE.ARPA>" of Sat 19 Jan 85 23:56:12-MST
I recall that the Mr. S. and Mr. P. problem once appeared in Martin
Gardner's column in Scientific American (probably sometime around 1979). I
think he called it "The Impossible Problem" since the statement of the
problem is apparanatly impossible to be true.
John McCarthy's challenge of solving it in a logic dealing with knowledge
is interesting and may lead to significant advances. However, just a few
pages before the cited paper of Xiwen and Weide in IJCAI-83, there is
another paper by Martin Nilsson of Uppsala dealing with the same problem.
Nilsson also gives a Prolog program that models his solution. I am
refraining from reproducing it here, because a study of the paper is
essential for an appreciation of the approach.
Uday Reddy
-------
∂22-Jan-85 1237 RA
Rob Porter from Ontario Center for Advanced Manufacturing (416) 675 4363
called re their Reference Guide to CAD/CAM and Robotics Development &
Information Centers (I put his letter and questionnaire on top of your
incoming mail pile). The VP of the robotics center and two senior members
of the center are going to be in CA next week and would like to meet with
you to discuss activity research. The results of their survey
are going to be published by The
will be published by the federal Canadian government.
Would you like to set a time for them to meet you?
Please let me know.
∂22-Jan-85 1323 RA
Hi Rutie,
I should have given you this when you were just here ....
Dennis Bark would like John McCarthy to call him. 7-2216.
Thanks, Kim
∂22-Jan-85 1510 RA
Dennis Bark returned your call 2216
∂22-Jan-85 1607 RA
Please call Andy Callahan (714) 493 8181 re LISP
∂23-Jan-85 0900 TAJNAI@SU-SCORE.ARPA Pretend it's BBoard
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Jan 85 09:00:13 PST
Date: Wed 23 Jan 85 08:56:04-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Pretend it's BBoard
To: JMC@SU-AI.ARPA
John, EG&G Idaho has definitely joined the Forum. How about being
their faculty liaison?
Carolyn
-------
∂23-Jan-85 0931 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Jan 85 09:31:10 PST
Date: Wed 23 Jan 85 09:30:32-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
[cwr] In the January '85 issue of Computer Design, pp.112 you are given
credit for inventing FORTRAN. Did Robert Kowalski invent COBOL?
-------
∂23-Jan-85 1552 CLT q
have you asked for a page for the proposal from the russian section?
(i can't spell chud...)
∂23-Jan-85 1657 @SU-SCORE.ARPA:pratt@Navajo Map to our house
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Jan 85 16:43:14 PST
Received: from Navajo.ARPA (SU-NAVAJO.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Wed 23 Jan 85 16:40:05-PST
Date: Wed, 23 Jan 85 16:39:53 pst
From: Vaughan Pratt <pratt@Navajo>
Subject: Map to our house
To: faculty@score
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←| |←←←←←←←←←←←←←←←←←←←←←←←←←←
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←Foothill←←←←←←Light←←←←←←Expressway←←←←←←←←←
Vaughan and Margot Pratt |P|
Street address: 2215 Gerth Lane /.a|.....one way - no entry to
Los Altos Hills //|g| Old Page Mill Road
Phone: 494-2545 // |e|
<PO address: 2215 Old Page Mill Rd. // | |
Palo Alto, CA 94304> Old || |M|
DIRECTIONS Page|| |i|
Take Page Mill to near 280 Mill|| |l|
Follow sign to Old Page Mill Road Road|| |l|
Gerth Lane has row of mailboxes............|| Light←←←←←←←←←←←←←←←←←←←←←←←←←
Park behind mailboxes.................... :|| |E --------------------------
Cross bridge........................... : :|| |x| Deer Creek Road
2215 is second on left....... : : :|| |p|
: : : :|| |w|
Gerth Lane : : : :|| |y| only entry to
=================:=========#=:=:= === .!.....Old Page Mill Road
2215 2209 : M \\ | | and Gerth Lane
<not to scale> :.P \\| |
\ |
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←| |←←←←←←←←←←←←←←←←←←←←←←←←←
←<--SF←←←←←←←←←←←←←←←←←←←←←←Route 280←←←←←←←←←←←← ←←←←←←←←←←←←←←←←←←←←←SJ-->
∂23-Jan-85 1713 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 23 Jan 85 17:12:11 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 23 Jan 85 17:09:58-PST
Date: 23 Jan 85 1630 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: su-bboards@SU-AI.ARPA, "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Gordon Plotkin,
Department of Computer Science, Edinburgh University
Title: Types and Partial Functions
Place: Room 381-T, Math Corner, Stanford
Time: Monday, January 28, 4:15-5:30 P.M.
∂23-Jan-85 1713 ERIC@SU-CSLI.ARPA Talk
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 23 Jan 85 17:13:24 PST
Date: Wed 23 Jan 85 17:10:27-PST
From: Eric Ostrom <ERIC@SU-CSLI.ARPA>
Subject: Talk
To: jmc@SU-AI.ARPA
John:
It has been suggested that I talk to you about getting
the Dean of Graduate Studies to provide money for computer
text processing, hopefully some of which will go to buy time on
Turing (our 20). Can we do this?
eric
-------
∂23-Jan-85 1715 WIEDERHOLD@SU-SCORE.ARPA CS colloquium Leiserson Parallel architecture Jan.29
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Jan 85 17:15:26 PST
Date: Wed 23 Jan 85 17:04:11-PST
From: Gio Wiederhold <WIEDERHOLD@SU-SCORE.ARPA>
Subject: CS colloquium Leiserson Parallel architecture Jan.29
To: ALL-COLLOQ@SU-SCORE.ARPA, TULEY@SU-SCORE.ARPA, FACULTY@SU-SCORE.ARPA,
MILTON@SRI-AI.ARPA, MORGENSTERN@SRI-CSL.ARPA
CS 300 -- Computer Science Department Colloquium -- Winter 1984-1985.
Our fourth meeting will be on
Tuesday, January 29, 1985
at 4:15 in Terman Auditorium
FAT-TREES:
Universal Networks for Hardware-Efficient Supercomputing
Charles E. Leiserson
Laboratory for Computer Science
Massachusetts Institute of Technology
Cambridge, Massachusetts 02139
Abstract--This paper presents a new class of universal routing
networks called ``fat-trees,'' which might be used to interconnect the
processors of parallel-processing supercomputers. A fat-tree routing
network is parametrized not only in number of processors, but also in
the amount of simultaneous communication it can support. Since
communication can be scaled independently of number of processors, a
communication-limited fat-tree can save substantial hardware over, for
example, hypercube-based networks, for such application programs as
finite-element analysis. On the other hand, these programs can be
transported to a more expensive machine with more communication
capability because the routing network architecture is the same.
More interestingly from a theoretical standpoint, we use a
three-dimensional VLSI model that incorporates wiring as a direct cost
to prove that a fat-tree of a given size is nearly the best routing
network of that size. For any given amount of communication hardware,
a fat-tree built from that amount of hardware can simulate any other
network built from the same amount of hardware, using only slightly
more time (a polylogarithmic factor greater). The basic assumption we
make of competing networks is the following. In unit time, at most
O(a) bits can enter or leave a closed three-dimensional region with
surface area $a$.
Prof. Katevenis will introduce Dr.Leiserson.
-------------------------------->
Cookies, and if we can find a Juice-getting-volunteer, juice prior to the
colloquium, at 3:45 in the Margaret Jacks Hall Lounge.
---------------------------------------> see you there
-------
∂23-Jan-85 1753 GLB
(proof bug)
(ASSUME |∀X.¬(A(X)∧A1(X))|)
(label SUM_C2 )
6. (ASSUME |A(X)∨A1(X)|)
(label sum_c3)
(derive |¬a1(x)| (* sum_c2 ))
8. (ASSUME |¬(A(X)∧A1(X))|)
;deps: (8)
(derive |¬a1(x)| (* sum_c3))
; failed to derive
¬A1(X)
(show )
∂24-Jan-85 0124 LES QLISP proposal outline
On digging through accumulated messages, I find that I have a December 14
outline from you based on the Hep. As I recall, you sent a revised
version later but I don't find it here. Perhaps it was sent to LES and
went off into never-never land -- the flakey Unix mail programs gag on
large messages and fail to deliver.
If you can send a copy or a pointer to LES-HERE, I will carry on.
Incidentally, here is a copy of what Fateman sent.
-----------------------------------
Algebraic manipulation and parallel lisp....
We propose to examine
various areas of applications of lisp, and in particular, parallel
dialects of lisp.
Our areas of interest include algebraic manipulation programs
(typified by Macsyma) and other symbolic mathematical manipulation
which have arisen in applied mathematics and which
appear to be of interest in AI applications.
We would design, implement, analyze, and compare these results to
sequential computation.
Possibilities for use of parallel processors within algebraic
manipulation systems (taking Macsyma as a specific example).
1. Exploit obvious cases of traditional
parallel algorithms, e.g. FFT for multiplying polynomials
or try a PDE solver in some kind of semi-symbolic grid form.
(Macsyma generally does not ordinarily do either of these)
2. Use multiple processors to multiply two polynomials by
divide & conquer, or by farming out partial products. Adding them
together is tricky (and O(n↑2 log n)).
3. Examine multiple-homomorphism (mod Q) algorithms such
as GCD, ... try to do several moduli at
the same time (probably a loss since often only one modulus is needed).
A better prospect is parallel (multivariate)interpolation
and/or evaluation of a polynomial. Parallel versions of Newton
interpolation and of Horner's rule have been studied over the years.
4. Some specific modQ algorithms: e.g. Factoring over the
integers... generally several moduli ARE used. This is
not the expensive part of factoring, though. Combinatorial
matching is... can we do that?
5. Linear algebra algorithms: calculation of minors for determinants.
6. General simplification of expressions in trees: to simplify
f(a,b,c,..) one simplifies a,b,c,... and then f(a', b' , ...).
Sometimes (e.g. if f == plus), one must sort a', b' ... etc.
Use a sort-merge or similar technique. (in Macsyma, this "ordergreat"
function is quite expensive).
7. Pattern matching (e.g. for integration): Careful: many of
these patterns depend on the fact that they are tried out only
after others have failed.
8. Heuristic problem solving (NOT used in Macsyma, generally)..
and/or trees or searching in semantic networks.
9. Storage allocation: user-controlled reference counts maintained
at the same time, parallel GC of Large Objects. Maintenance of data
base of some sort (this may be harder in parallel because of simultaneous
updating problems). None of this is done in Macsyma now.
10. Parallel GC of cons cells using some well-known algorithms
(Since Macsyma on VAX or Sun spends only 30% of time in GC, using
a parallel version could not improve performance by more than 30%.)
11. Frame-based objects with multiple representations: compute
simultaneously with different forms (e.g.
polynomials:[expanded, recursive, factored],
curves:[parametric, point-set, constraints],
matrices:[dense, sparse, factored])
Resources needed:
We assume there will be an implementation effort at Stanford which
will produce a Q-lambda simulation and an actual Q-lambda implementation
on a parallel architecture machine.
The simulation would be available for use on hardware already in place
at UCB (including VAX, SUN, Symbolics, or Xerox), but that the actual
parallel processor would be at Stanford. Substantial computing would
be required at UCB for program preparation, testing, communication,
etc.
3 Research Assistants (Carolyn Smith, Scott Morrison, P. Mcgeer) would
work on this project; a part-time programmer would be hired, and some
clerical assistance for project administrative tasks etc.
1 Month of summer support for Fateman.
Other support for PI:
Fateman has a contract with the Army Research Office for a project
in algebraic manipulation, ($63k/year); Fateman is one of 6
co-investigators
on the SPUR project at UCB ($4.4 million over 4 years); Fateman and
Despain are co-principle investigators on an NSF contract ($25k)
for running a conference on high speed symbolic computation to be
held in February, 1985.
∂24-Jan-85 0212 WIEDERHOLD@SUMEX-AIM.ARPA [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: Re: Talking to Klaus Wirth]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 02:12:36 PST
Date: Wed 23 Jan 85 18:51:31-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: Re: Talking to Klaus Wirth]
To: jmc@SU-AI.ARPA
I invited Klaus wirth:
---------------
Return-Path: <NILSSON@SU-SCORE.ARPA>
Received: from SU-SCORE.ARPA by SUMEX-AIM.ARPA with TCP; Wed 23 Jan 85 18:00:39-PST
Date: Wed 23 Jan 85 17:49:23-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: Talking to Klaus Wirth
To: WIEDERHOLD@SUMEX-AIM.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>" of Wed 23 Jan 85 17:09:42-PST
Thanks. (Did anyone remember to invite Joe Halpern--the
industrial lecturer from IBM who is visiting Stanford this quarter?)
-Nils
-------
-------
∂24-Jan-85 1334 RA
Bob Finzi from Merril Lynch Venture Capital called re your being mentioned
as reference for Stan Kugell. His tel: (212) 980 0438.
∂24-Jan-85 1345 cha@mitre-bedford Info on CSLI summer school
Received: from MITRE-BEDFORD.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 13:44:30 PST
Date: Thursday, 24 Jan 1985 16:38-EST
From: cha@Mitre-Bedford
To: jmc@su-ai
Cc: cha@Mitre-Bedford
Subject: Info on CSLI summer school
Dear John,
I understand that the CSLI are planning a cummer school and meeting at
Stanford on July8-20, 1985. According to the flier I have, I can get more
info and registration forms from Ingrid Deiwiks, CSLI, Ventura Hall.
Since yours is the only arpa address I have handy, I wonder if you could relay
my request to Ingrid or the appropriate parties.
The info and registration forms can be sent to me at:
Charles Applebaum
Department of Mathematics and Statistics
Bowling Green State University
Bowling Green, Ohio 43403
By the way, thank you for sending the papers.
Sincerely,
Charles Applebaum
∂24-Jan-85 1407 FFL Consulting Disclosure Form
To: guibas@DECWRL.ARPA, katevenis@SU-SHASTA.ARPA,
lantz@SU-SCORE.ARPA, ZM@SU-AI.ARPA, mayr@SU-SCORE.ARPA,
JMC@SU-AI.ARPA, papa@SU-SCORE.ARPA, FFL@SU-AI.ARPA
Yesterday a hard copy of this Consulting Disclosure Form was sent to you by
Professor Nilsson. This is a duplicate for your convenience.
CONSULTING DISCLOSURE FORM
Computer Science Department
Stanford University
In order to represent to the University that its policy regarding consulting is
being observed, the CSD Chairman must have certain minimum information about the
consulting activities of the faculty. An annual survey (conducted early in the
calendar year) is our way of gathering that information.
The data requested below will be held in confidence by the department chairman.
Please return by February 15, 1985. Please include time spent on the advisory
boards or boards of directors of private companies (see pp. 38-40 of Faculty
Handbook). Please also include time that is not compensated by consulting fees
if such time is spent at companies in which you have an ownership interest and if
that time would ordinarily be compensated by consulting fees if the same work were
being performed for a company in which you did not have an ownership interest.
Name of Organization Number of Days
Winter '84 Spring '84 Summer '84 Autumn '84
Information International 2 2 1 1
Inference Corp. 2 2 2 3
MAD computer 0 1 0 1
IBM 0 0 5 0
MCC 0 0 0 1
Name________________
Signed______________
Date________________
∂24-Jan-85 1409 RA
Bob Kahn left a note for you on your desk.
∂24-Jan-85 1536 WIEDERHOLD@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 15:12:02 PST
Date: Thu 24 Jan 85 15:10:59-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 24 Jan 85 03:46:00-PST
sorry to let you in on the tail of a conversation.
We were inviting people to the reception for Nils at PrattS house this saturday.Could you contact Halpern? Thanks Gio
-------
∂24-Jan-85 1539 INGRID@SU-CSLI.ARPA Info on CSLI Summer School
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 15:38:48 PST
Date: Thu 24 Jan 85 15:38:41-PST
From: Ingrid Deiwiks - 497-3084 <INGRID@SU-CSLI.ARPA>
Subject: Info on CSLI Summer School
To: jmc@SU-AI.ARPA
I'll be sending the relevant forms to Charles Applebaum today.
Ingrid
-------
∂24-Jan-85 1600 fateman%ucbdali@Berkeley Re: Bob Kahn is here
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 16:00:33 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.41)
id AA10864; Thu, 24 Jan 85 16:01:55 pst
Received: by ucbdali.ARPA (4.24/4.40)
id AA00903; Thu, 24 Jan 85 16:01:48 pst
Date: Thu, 24 Jan 85 16:01:48 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8501250001.AA00903@ucbdali.ARPA>
To: JMC@SU-AI.ARPA
Subject: Re: Bob Kahn is here
OK with me. my office phone is 415 642 1879; home is 848-0409.
∂24-Jan-85 1611 RA
Please call Jim Adams @ 7-2565
∂24-Jan-85 1613 RA Bob Kahn
Bob would like you to call him at Travelodge 493 6340 when you come back. He will
free his schedule this evening so you can get together any time after 6:00.
∂24-Jan-85 1626 RA Bob Kahn
Bob just called to tell you that things did not work for tonight. He would
like to come and see you tomorrow at 2:30. He has time until 5:30. If you
cannot make it at 2:30 and would like him to come by later, please let me know
because he is going to be on campus earlier and will check with me whether
2:30 date is ok.
To CLT, RPG, LES, Fateman
Those who can should make it, because it may save us a trip to Washington
or make one more fruitful. I think it is worthwhile for him to meet
as many of the principal people as possible, and we'll be more responsive
to his concerns if we all know them. I'm sorry there didn't turn out to
be any flexibility in time. - John
∂24-Jan-85 1719 RA
Richard Fateman will come to the meeting tomorrow.
∂24-Jan-85 1756 Hays@SRI-KL.ARPA thanks, lets do it again
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 17:56:33 PST
Date: Thu 24 Jan 85 17:34:12-PST
From: Hays@SRI-KL at SU-DSN
Subject: thanks, lets do it again
To: jmc at SU-AI
Sorry i had to rush away from the lunch the other day. This is
just to say thanks for the lunch and the company, and i hope we
can get together again before too long.
bbest wishes
pat
-------
∂24-Jan-85 1857 SG DM2500 works well
To: JMC, ME
CC: SG
My DM2500 works well at my office. I will carry it to my house.
Thank you very much.
∂24-Jan-85 1951 RPG
To: JMC, CLT
see you at 3:15 at Jacks.
∂24-Jan-85 2046 fateman%ucbdali@Berkeley Re: microadjustment
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 20:46:01 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.41)
id AA15822; Thu, 24 Jan 85 20:47:22 pst
Received: by ucbdali.ARPA (4.24/4.40)
id AA04765; Thu, 24 Jan 85 20:47:19 pst
Date: Thu, 24 Jan 85 20:47:19 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8501250447.AA04765@ucbdali.ARPA>
To: JMC@SU-AI.ARPA
Subject: Re: microadjustment
Cc: clt@su-ai
OK.
∂25-Jan-85 0538 OHLANDER@USC-ISI.ARPA
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 25 Jan 85 05:38:46 PST
Date: 25 Jan 1985 08:39-EST
Sender: OHLANDER@USC-ISI.ARPA
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <[USC-ISI.ARPA]25-Jan-85 08:39:52.OHLANDER>
In-Reply-To: The message of 18 Jan 85 2320 PST from John McCarthy <JMC@SU-AI.ARPA>
John,
Thanks for your response.
Ron
∂25-Jan-85 0805 CS.RICH@UTEXAS-20.ARPA re: fantasy in HCN
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 25 Jan 85 08:04:54 PST
Date: Fri 25 Jan 85 10:05:34-CST
From: Elaine Rich <CS.RICH@UTEXAS-20.ARPA>
Subject: re: fantasy in HCN
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 3 Jan 85 19:35:00-CST
Did you get the stuff I sent? Do you still want to send something?
Elaine
-------
∂25-Jan-85 0900 CLT*
bring terminal (also adapter plug for phone so we can test it)
∂25-Jan-85 0932 TW
To: JMC@SU-AI.ARPA
CC: TW@SU-AI.ARPA, reges@SU-SCORE.ARPA, jutta@SU-SCORE.ARPA
John,
We have made 206 a requirement for the new masters track, and a number
of students are interested in taking it before next fall. Stuart
suggested that we do it as a tutored videotape, using your tapes
and getting an advanced student to work with it. Is that OK with
you? It would be in Spring, Summer, or both. --t
∂25-Jan-85 1000 NILSSON@SU-SCORE.ARPA Tuesday lunches
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Jan 85 10:00:06 PST
Date: Fri 25 Jan 85 09:50:41-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Tuesday lunches
To: faculty@SU-SCORE.ARPA
Faculty Tuesday Lunch Topics
Winter Quarter, 1985
Tentative Agenda
Jan. 29 "If we had the slots, who would we want to hire?"
Feb. 5 The New Stanford Telephone System
Guest: Mike Roberts, Deputy Director ITS
Feb. 12 Discussion with Provost James Rosse and Associate
Dean Gordon Bower
Feb. 19 The Role of Televised Instruction at Stanford
Guest: James Gibbons, Dean of Engineering
Feb. 26 Planning for a new CSD Building
Guest: Jacqueline Bryan, H&S Dean's Office
March 5 What Equipment Ought A First-Class CS Dept. Have?
As yet Unscheduled:
CSD, CSL, and EE
(Guests from CSL and Robert White)
The Math/CS Library (Guest: Harry Llull)
Should the CS re-start the "visiting committee?"
CSD Teaching Load
[Please send any suggestions for other topics to Nils Nilsson]
-------
∂25-Jan-85 1116 RA Vienna trip
You can take PAN AM on Tues. Jan, 29 5:30pm to London. Arrives London
11:30am Wed. and then take a 1:30pm flight to Paris, arrive Paris
3:30pm. On Thursday Jan.31 take a Paris-Vienna flight, which leaves Paris 11:05am
arrive Vienna 1:00pm.
Another possibility is to leave Wed. 1/30 on PAN AM SF-NY 9:00am, arrive NY
5:14pm. TWA to Vienna 6:50pm, arrive Vienna 11:00 am Thrursday, 1/31.
On the trip back you leave Vienna with PAN AM 9:40am, arrive JFK 2:20pm,
leave NY 4:20pm, arrive SF 7:24pm.
As far as upgrading, you need a certificate from PAN AM for that, unless you
already have one, it is too late to issue you one for the Tuesday flight.
Please let me know which flight you want to take. I booked you on the return
flight but am waiting for your decision on the flight to Vienna.
∂25-Jan-85 1348 RA
Jack Harper from Robot System in Denver Colorado (313) 450 0793 called re
parallel LISP system.
∂25-Jan-85 1440 RA
David Chudnovsky called. He'll call again later.
∂25-Jan-85 1518 HI.RICH@MCC.ARPA re: fantasy in HCN
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 25 Jan 85 15:18:19 PST
Date: Fri 25 Jan 85 17:19:55-CST
From: Elaine Rich <HI.RICH@MCC.ARPA>
Subject: re: fantasy in HCN
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 25 Jan 85 13:23:00-CST
I sort of like the original note. A small of touch of subtlety (sp?)
is sometimes nice. I hate to admit this, but I believe that there is
some Kool Aid in my kitchen. I'll try to remember to check the spelling
when I go home.
Elaine
-------
∂25-Jan-85 1955 JJW@SU-AI.ARPA CSD facilities
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 25 Jan 85 19:55:34 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Fri, 25 Jan 85 19:54:41 pst
Date: 25 Jan 85 1954 PST
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: CSD facilities
To: csdfacilities@SU-PESCADERO.ARPA
Today I saw some boxes from SUN, and was told that they contain the work-
stations that the committee and faculty decided to purchase. That's fast!
I'd like to see some coherent plan about where to put these (to allow
student access, especially considering students without offices), and
perhaps some guidelines on their use. Is there any introductory manual
describing how to use SUNs in the Stanford environment, that could be
provided for general users?
There is a student meeting this Monday, at which these SUNs will presumably
be announced, and Jeff has arranged a special facilities "town meeting" for
the following Monday, February 4, at noon, so that Nils and Len can hear
anyone's comments or suggestions.
One final thought: earlier I brought up the possibility of getting TI
Explorer Lisp machines, but this wasn't pursued. Tom Rindfleisch has told
me that various individuals have talked to TI, but perhaps this committee
should also do so, to represent the interest of the department as a whole in
getting Lisp machines for student use.
Joe
∂26-Jan-85 0900 JMC*
raj
∂26-Jan-85 0959 AAAI-OFFICE@SUMEX-AIM.ARPA Re: council
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 Jan 85 09:59:05 PST
Date: Sat 26 Jan 85 09:58:22-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Re: council
To: JMC@SU-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 19 Jan 85 00:58:00-PST
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I'm not ignoring your request for the list of past and present councilors,
but I had that info on an archived file on sumex and the file(s) have
been archived incorrectly. As soon as the operators figure out what they
did, I'll send you the list.
CCM
-------
∂26-Jan-85 2121 ATP.BLEDSOE@UTEXAS-20.ARPA Re: presidency
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 26 Jan 85 21:21:39 PST
Date: Sat 26 Jan 85 23:22:20-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: presidency
To: JMC@SU-AI.ARPA, fikes@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA,
bledsoe@UTEXAS-20.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 26 Jan 85 11:57:00-CST
Yes, I'm sure we do need to ask the membership to vote on the two year term
for Presidents. Claudia, are there other items that we passed at the
Council meeting that has to be ratified by membership vote?
I am delighted to hear that Raj is willing to serve. I suppose the
vote for that will be taken sometime later.
-------
∂27-Jan-85 1400 @SU-SCORE.ARPA:pratt@Navajo coat left
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 27 Jan 85 14:00:38 PST
Received: from Navajo.ARPA (SU-NAVAJO.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Sun 27 Jan 85 13:58:31-PST
Date: Sun, 27 Jan 85 13:58:32 pst
From: Vaughan Pratt <pratt@Navajo>
Subject: coat left
To: faculty@score
Anyone missing a coat from Friday?
-v
∂27-Jan-85 1619 GOGUEN@SRI-AI.ARPA party!
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Jan 85 16:19:40 PST
Date: Sun 27 Jan 85 16:19:49-PST
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: party!
To: tw@SU-AI.ARPA, barwise@SU-CSLI.ARPA, john@SU-CSLI.ARPA, madsen@SU-CSLI.ARPA,
meseguer@SRI-AI.ARPA, clt@SU-AI.ARPA, jmc@SU-AI.ARPA, stickel@SRI-AI.ARPA,
shieber@SRI-AI.ARPA, hans@SRI-AI.ARPA, grosz@SRI-AI.ARPA,
betsy@SU-CSLI.ARPA, tarlecki@SU-CSLI.ARPA, plotkin@SU-CSLI.ARPA,
briansmith@XEROX.ARPA, pereira@SRI-AI.ARPA
cc: goguen@SRI-AI.ARPA
This is an invitation to a party in honor of our two Area C visitors this
month, Gordon Plotkin from Edinburgh, and Andrzej Tarlecki from Edinburgh
(visiting from the Polish Academy of Sciences, Warsaw). It is also a
chance for all of us to get together informally as a group. -- Joseph
Date: 1 February 1985
Time: 9pm
Place: 209 McKendry Drive, Menlo Park
(parallel to and 1 block S. of Willow, just E. of Middlefield; turn off
Willow at Blackburn or else at Gilbert)
Phone: 326-6832 for help
P.S. I have the feeling that I may have forgotten to invite some relevant
people; if you see any omissions on the address list, please let me know!
-------
∂27-Jan-85 1620 GOGUEN@SRI-AI.ARPA party!
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Jan 85 16:20:40 PST
Date: Sun 27 Jan 85 16:20:51-PST
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: party!
To: tw@SU-AI.ARPA, barwise@SU-CSLI.ARPA, john@SU-CSLI.ARPA, madsen@SU-CSLI.ARPA,
meseguer@SRI-AI.ARPA, clt@SU-AI.ARPA, jmc@SU-AI.ARPA, stickel@SRI-AI.ARPA,
shieber@SRI-AI.ARPA, hans@SRI-AI.ARPA, grosz@SRI-AI.ARPA,
betsy@SU-CSLI.ARPA, tarlecki@SU-CSLI.ARPA, plotkin@SU-CSLI.ARPA,
briansmith@XEROX.ARPA, pereira@SRI-AI.ARPA
cc: goguen@SRI-AI.ARPA
P.S.: The invitation is definitely intended to cover spouses, spices, and
other members of couples generally.
-------
∂27-Jan-85 2121 RPG Qlambda paper
To: les-here, CLT
CC: JMC
I have a longer version of the qlambda paper, which I think should
go with the proposal as an appendix. It is QLAMBDA.TEX and QLAMBDA.PRE[PAP,RPG].
-rpg-
∂27-Jan-85 2320 HST gwai-invited talk
hi john!saisins greetings!we could fix the thing with your invited talk now.
open are the financial affairs:what flight do you want?(is business class
good - or standby(not serious))do you want a honorarium?
please note the date:23.-28.september.
∂28-Jan-85 0816 AAAI-OFFICE@SUMEX-AIM.ARPA By-law amendments
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 08:16:10 PST
Date: Mon 28 Jan 85 08:13:28-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: By-law amendments
To: ai.woody@MCC.ARPA, JMC@SU-AI.ARPA, Fikes@USC-ECL.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
FYI: This is the statement from the By-laws about amendments to it.
"Article X. Amendments
Section 2. Power of Executive Council to Amend By-Laws: Subject to the
limitations of the Articles of Incorporation, these By-Laws and the
General Non-Profit Corporation Law of California concerning the action
that must be authorized or approved by the members of the corporation,
the By-Laws of this corporation may be amended,repealed or added to,
or new By-Laws may be adopted by a resolution of the Executive Council."
I'm not aware of additional amendments suggested by the Council at the
August meeting; however, we still have time to suggest other amendments,
get them ratified by the Council and then prepared for the ballot.
-Claudia
-------
∂28-Jan-85 0901 JMC*
cleaning
∂28-Jan-85 0909 RESTIVO@SU-SCORE.ARPA CS226
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 09:09:04 PST
Date: Mon 28 Jan 85 09:02:05-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: CS226
To: JMC@SU-AI.ARPA
[cwr] I am interested in CS226. Would it be alright to "audit" this
course?
-------
∂28-Jan-85 1023 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 10:23:11 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 28 Jan 85 10:15:54-PST
Date: Mon 28 Jan 85 10:17:26-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 reminder
To: f4@SU-CSLI.ARPA
Remember, F4 meets today at 1:15
---------------
Return-Path: <@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA>
Received: from SU-SCORE.ARPA by SRI-AI.ARPA with TCP; Thu 17 Jan 85 16:08:02-PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Thu 17 Jan 85 16:05:18-PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 17 Jan 85 16:00:45-PST
Date: Thu 17 Jan 85 16:05:00-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
There will be no F4 meeting on Monday, Jan. 21, due to Stanford's
observance of Martin Luther King Day. The next F4 meeting will be on
Monday, Jan. 28 at 1:15 in the Ventura conference room. Stan
Rosenschein will give a presentation on robot design. Background
reading is "Shakey the Robot" by Nils Nilsson. Copies have been
placed in the Ventura reading room.
-------
-------
∂28-Jan-85 1058 GOLUB@SU-SCORE.ARPA Visit by Alan George
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 10:57:14 PST
Date: Mon 28 Jan 85 10:45:00-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Visit by Alan George
To: faculty@SU-SCORE.ARPA
cc: su-bboards@SU-SCORE.ARPA, serra@SU-SCORE.ARPA, na-seminar@SU-SCORE.ARPA
Alan George is in residence this week in connection with his giving the
Forsthe Lectures. He will be here until Friday morning.
You can reach him at 497-1923. His office is 312 MJH.
GENE
-------
∂28-Jan-85 1118 RA trip to Vienna
If we can get you an upgrade, do you want it upgraded from couch to business, or
from business to first class? You cannot upgrade from couch to first class. Please
let me know asap.
∂28-Jan-85 1123 RA
Richard Gordon from UC Santa Cruz called re Strategic Computer Sconference.
His tel.:(408) 425 1865.
∂28-Jan-85 1201 @SU-SCORE.ARPA:FFL@SU-AI.ARPA e
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 12:01:21 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Mon 28 Jan 85 11:58:19-PST
Date: 28 Jan 85 1151 PST
From: Fran Larson <FFL@SU-AI.ARPA>
Subject: e
To: faculty@SU-SCORE.ARPA
Faculty lunch, noon, Tuesday, January 29. Agenda: "If we had the slots,
who would we want to hire?"
∂28-Jan-85 1228 RA Vienna trip
You are booked on PAN AM 124 1/30/85 SF to London. Leaves SF 5:30pm, arrives
London 11:25pm 1/31. British Air 604 from London 2:20pm, arrives Vienna 5:30pm.
On the way back you are booked on PAN AM 77. Leaves Vienna 9:40am, arrives JFK
2:20pm, to SF you take PAN AM 67, leaves NY 4:20pm, arrives SF 7:24pm. You
are wait listed on a different flight which will get you into SF earlier. The
latter is Austrian Airline 457 to London, leaves Vienna 7:55am, arrives London
9:25am. From London PAN AM, leaves London 12:45pm, arrives SF 3:30pm. We
wait listed you because business class was booked up on the London-SF leg of the
trip. Frank will wait until Wednesday morning to issue the ticket in order to
try and get you the second flight.
taxi Hotel Mercur, Fleischmarkt in inner city, Vienna 1
∂28-Jan-85 1313 LIBRARY@SU-SCORE.ARPA Lasers in Graphics Electronic Publishing in the 80's Conf. 1983
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 13:12:57 PST
Date: Mon 28 Jan 85 13:09:23-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Lasers in Graphics Electronic Publishing in the 80's Conf. 1983
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
The two volume 1983 conference proceedings of Lasers in Graphics Electronic
Publishing is in the Engineering Library -- Call number 84-06533 volume 1
and volume 2.
HLlull
-------
∂28-Jan-85 1323 JJW Major LP Milestone Set In Place
In case you haven't seen this ...
∂27-Jan-85 2216 LLW@S1-A.ARPA Major LP Milestone Set In Place
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 27 Jan 85 22:16:35 PST
Date: 27 Jan 85 2214 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Major LP Milestone Set In Place
To: "@LOCAL.[1,CEG]"@S1-A.ARPA
Hear Ye! Hear Ye!
Yesterevening (continuing to 0500 this morning), the Laser Pantography
Project, represented by a team consisting of its most stalwart members
Tony Bernhardt, Steve Farmwald (distant relative of the famous San
Francisco bon vivant), Jim Kaschmitter, Bruce McWilliams, Rich Mendonca
and Fred Mitlitsky, set in place a major milestone: an area of silicon
wafer (prepared Friday under the supervision of master silicon chef Dave
Tuckerman) of the order of 100 square centimeters had about 10,000
complete interconnect patterns of a CMOS-implemented D-type flip-flop
written in doped polysilicon gracefully (which is to say, not too closely
spaced) over it, in a square array.
This laser pantographic tour de force, which wrote approximately 2 micron
wide interconnect in the patterns and over the distances needed to connect
about 200,000 CMOS transistors of the flavor represented by our standard
CMOS gate arrays into D-type flip-flops, was accomplished in roughly 3
hours of writing time, at an average writing rate about two orders of
magnitude lower than that which we expect to attain in the next few months.
This notable accomplishment occurred within 12 hours of the initial
existence of the minimum essential technical means required for its
attainment. (This crew doesn't let any grass grow under its feet!) The
wafer on which this capability was so splendidly expressed will be available
for admiration Tuesday evening, immediately after it returns from its
obligatory pilgrimage to Washington.
This entire LP team (as well as Fritz Rittmann, who rescued the effort
from disaster Friday evening by deft surgery on the wafer-scale LP cell,
Kirk Hazelton, who contributed notably to its efforts during the past
three weeks, and John Whitehead, who contributed in a distinguished manner
until the creme-de-la-creme of the cookie supply was polished off about
1600 yesterafternoon) is to be congratulated on this accomplishment--and
encouraged to recapitulate it with a real wafer of CMOS gate arrays
positioned under the flying laser paintbrush, as soon as ever possible!
Integration of an entire wafer of gate arrays comes distinctly into view!
Lowell
∂28-Jan-85 1323 RA
Shall I charge Joe Halpern's SAIL account to your ARPA?
∂28-Jan-85 1459 RA
Pat Suppes called.
∂28-Jan-85 1538 TAJNAI@SU-SCORE.ARPA Change in Session II
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 15:38:33 PST
Date: Mon 28 Jan 85 15:37:47-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Change in Session II
To: JMC@SU-AI.ARPA, MA@SU-AI.ARPA, YOM@SU-AI.ARPA, Reid@SU-GLACIER.ARPA,
ZM@SU-AI.ARPA
cc: "*PS:<CS.FORUM>85PROGRAM..9"@SU-SCORE.ARPA
John, Session II has been shortened. Kaizhi Yue has been moved to
Thursday morning. Your session is
10:50 a.m. to 11:30 a.m. Wednesday, 13 Feb.
Martin Abadi
Yoram Moses
are the speakers.
Zohar, please introduce Martin; John, please introduce Yoram. John,
it is your responsibility as session chairman to keep the session on
schedule.
Thanks,
Carolyn
-------
∂28-Jan-85 1554 mogul@Navajo Re: CSD facilities
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 15:54:17 PST
Received: from Navajo.ARPA by Pescadero with TCP; Mon, 28 Jan 85 15:53:24 pst
From: Jeff Mogul <mogul@Navajo>
Date: 28 Jan 1985 1553-PST (Monday)
To: Joe Weening <JJW@SU-AI.ARPA>
Cc: csdfacilities@pescadero
Subject: Re: CSD facilities
In-Reply-To: Joe Weening <JJW@SU-AI.ARPA> / 25 Jan 85 1954 PST.
Today I saw some boxes from SUN, and was told that they contain the work-
stations that the committee and faculty decided to purchase. That's fast!
I'd like to see some coherent plan about where to put these (to allow
student access, especially considering students without offices), and
perhaps some guidelines on their use. Is there any introductory manual
describing how to use SUNs in the Stanford environment, that could be
provided for general users?
(1) I propose that we put them in places where we now have semi-public,
and perhaps public, terminals (although NOT in the MJH basement terminal
area.) I'd like to avoid putting them on individual student desks unless
there is no other space. Joe and I plan to survey the building later
this week for likely spots.
(2) The Sun-50s are useless until the V group (DSG) gets enough info
from Sun and Intel to re-write the ethernet interface driver. I
believe that they have people working on this.
(3) I think it would be a good idea for someone from DSG to do a
"Non-Programmer's Guide to the V-system", no more than 10 pages,
describing how to: boot, use VGTS, run telnet, perhaps run ved and
vemacs, how to find further documentation, and a list of the
things that one can already do (i.e., existing programs) without
major hacking.
∂28-Jan-85 1629 TAJNAI@SU-SCORE.ARPA Visitors
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Jan 85 16:29:27 PST
Date: Mon 28 Jan 85 16:28:41-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Visitors
To: JMC@SU-AI.ARPA
cc: : ;
John, we are very short of space this year and I must check carefully
before inviting visitors to the Forum.
I will invite Shigeki Goto. I was informed by the NTT office in
NYC that he was visiting you. It would be much appreciated if you
would let me know when you have Forum visitors. Normally, I
coordinate all industrial visitors, and in CSL they charge a fee
which goes to the host professor.
What about Weide Guo? Should he be invited?
CArolyn
-------
∂29-Jan-85 0840 RA
Jeff Newmeyer 858 6782 called re your being mentioned as a reference for
Victor Guo in Guo's resume.
∂29-Jan-85 0900 JMC*
Stan about class
∂29-Jan-85 0919 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 09:19:03 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 29 Jan 85 09:15:40-PST
Date: 29 Jan 85 0906 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Seminar in Logic and Foundations of Mathematics
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Dr. Ed Wimmers, IBM, San Jose
Title: What does it mean for rewrite rules to be "correct"?
Place: Room 381-T, Math Corner, Stanford
Time: Monday, February 4, 4:15-5:30 P.M.
Abstract:
We consider an operational definition for FP via rewrite
rules. What would it mean for such a definition to be correct? We
develop a new formal criterion for deciding whether there are enough
rewrite rules and show that our rewrite rules meet that criterion.
Our proof technique is novel in the way we use the semantic domain to
guide an assignment of types to the untyped language FP; this allows
us to adopt powerful techniques from the typed lambda-calculus theory.
S. Feferman
∂29-Jan-85 1226 sun!aster!pratt@Berkeley parking
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 12:25:57 PST
Received: by UCB-VAX.ARPA (4.24/4.41)
id AA02377; Tue, 29 Jan 85 12:27:23 pst
Received: from aster.sun.uucp by sun.uucp (1.2/SMI-1.2)
id AA12181; Tue, 29 Jan 85 11:41:29 pst
Received: by aster.sun.uucp (4.24/3.14)
id AA09541; Tue, 29 Jan 85 11:49:54 pst
Date: Tue, 29 Jan 85 11:49:54 pst
From: sun!aster!pratt@Berkeley (Vaughan Pratt)
Return-Path: <pratt@aster>
Message-Id: <8501291949.AA09541@aster.sun.uucp>
To: jmc@su-ai.ARPA
Subject: parking
Cc: aster!pratt@Berkeley
John, here's a question you may have the answer to, either in your
capacity as a senator or otherwise.
I needed to come in from Sun to MJ yesterday for ten minutes to check
on a paper Ariadne was sending out on my behalf. The pay lot next to
Herrin was taped off (they seem to be doing some construction), so
needless to say parking all around was chaotic. After wasting ten
minutes looking elsewhere I gave up and parked in the red zone, ducked
in, and came back out ten minutes later, by which time I had been
ticketed. The ticketing officer, who was still around, was
unsympathetic about the shortage of parking and declined to take back
the ticket. I asked him what I should have done and he said he didn't
know (which I was inclined to take as implicit acknowledgment of a
catch-22 situation for parkers in my situation).
I want to make some sort of protest about the quality of parking,
particularly when lots are closed on short notice for construction such
as happened with the one next to Herrin that day. My question is,
should I make the protest by contesting the ticket or by paying the
ticket and writing to someone? I have scheduled an appearance in the
Palo Alto traffic court in March, but this may be a pointless exercise
unless there is some way for the effect of this to percolate back to
Stanford.
The issue is not the fine itself ($10), which I don't mind paying, but
the quality of parking for people without A or C stickers. (I didn't
feel like paying for such a sticker while I was on leave, coming in
only once every couple of weeks.) When a whole lot is closed on short
notice it seems to me that Stanford should go more lightly on hassling
at least very-short-term parkers, e.g. by being more willing to take
back a ticket if the offender complains to the officer just after being
ticketed.
-v
∂29-Jan-85 1319 ullman@diablo Shapiro
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 13:18:58 PST
Date: Tue, 29 Jan 85 13:20:28 pst
From: Jeff Ullman <ullman@diablo>
Subject: Shapiro
To: jmc@sail, nilsson@score
Let me second theShapiro nomination.
I think he is a very impressive character, and one ofus
ought at least to approach him once.
∂29-Jan-85 1236 KUO job and paper
To: JMC
CC: KUO
Dear Prof.McCarthy:
Thank you very much for your concerns about my career arrangement. Actually
my plan relies partially on my wife's progress in her academic career. She will
be graduating this summer and she is interviewing for a job, therefore, I decide
to start my job hunting now.
One of my friends recently introduced my work to the new-found AI lab in
Lockheed and he mentioned to Dr.Jeff Newmeyer, manager of this lab, that I worked
in your lab. I hope I would have your permission to put your name in my Resume
to be submitted to this company and I wish I would have the pleasure to have your
reference on my behalf. I appreciate your kind help very much.
I remember last year you suggested me to publish the paper titled "A Formal
Natural Deduction System about Knowledge" as a Computer Science Department Report.
It seems to me by reading the recent issues of PROLOG Digest that a lot of people
have interest on puzzles involving knowledge. I think it might be a good time to
send the revised version for publication. Since this paper was written when I
worked in your lab and the main idea was based on your pioneering and long
continuing work, I would like to know your opinion about the authers to be
appearing on this paper.
Sincerely yours
Victor Kuo
∂29-Jan-85 1408 BARWISE@SU-CSLI.ARPA Tea Tomorrow
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 14:08:40 PST
Date: Tue 29 Jan 85 14:06:03-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Tea Tomorrow
To: Researchers@SU-CSLI.ARPA
cc: Susi@SU-CSLI.ARPA
"Logic, Language and Information"
Wednesday Tea
Jan 30, 1985
3:30
They sound good together, but what, if anything, does logic have to do
with CSLI's real subject matter of language and information. Here are
some claims we have heard over the past 18 months: logic comes in
through logical form; logic is just the study of information; logic is
in the mind (or theory) of the designer (or theorist); all reasonable
representation languages can be embedded in first-order logic; logic
is needed to do the inferenceing needed to understand discourse. I
hope holders of each of these views, and others, will come prepared to
defend their views.
-------
∂29-Jan-85 1446 RA
Please call Ed. Fredkin @ (617) 239 0444.
∂29-Jan-85 1449 RA
I put your flight tickets on your desk.
∂29-Jan-85 1539 JJW Reply problem
To: JMC
CC: bug-mail
∂29-Jan-85 1528 JMC parking
The reply macro failed on this. Can something be done?
∂29-Jan-85 1226 sun!aster!pratt@Berkeley parking
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 12:25:57 PST
Received: by UCB-VAX.ARPA (4.24/4.41)
id AA02377; Tue, 29 Jan 85 12:27:23 pst
Received: from aster.sun.uucp by sun.uucp (1.2/SMI-1.2)
id AA12181; Tue, 29 Jan 85 11:41:29 pst
Received: by aster.sun.uucp (4.24/3.14)
id AA09541; Tue, 29 Jan 85 11:49:54 pst
Date: Tue, 29 Jan 85 11:49:54 pst
From: sun!aster!pratt@Berkeley (Vaughan Pratt)
Return-Path: <pratt@aster>
Message-Id: <8501291949.AA09541@aster.sun.uucp>
To: jmc@su-ai.ARPA
Subject: parking
Cc: aster!pratt@Berkeley
JJW - This is because our mailer doesn't accept destinations with "!"
in them unless they are quoted. I could try hacking the REPLY macro to
treat this as a special case, but I shouldn't have to. Maybe MAIL can
be fixed.
∂29-Jan-85 1543 RA
I am leaving early today. See you tomorrow.
∂29-Jan-85 1642 NILSSON@SU-SCORE.ARPA What have you done lately?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 16:42:06 PST
Date: Tue 29 Jan 85 16:26:07-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: What have you done lately?
To: faculty@SU-SCORE.ARPA
I really am sorry to have to bother you about this, BUT the Dean's office
tells me that we start thinking next month about faculty raises. Gene
Golub will remember some of the great things about you all that I will
need to present to the deanery. I have asked him to help out as much
as he can in this task--since I am so new to it. Anything else you
can send me telling me about your accomplishments during the last year
(research, teaching, "good citizenship" for CSD, Stanford and your field)
will help immensely. Thanks, -Nils
-------
∂29-Jan-85 1645 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 16:45:32 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 29 Jan 85 16:41:40-PST
Date: Tue 29 Jan 85 16:43:25-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
The next F4 meeting will be Monday, Feb. 11 at 1:15 PM in the Ventura
conference room. At that time I will give what I think are the
arguments for a representationalist approach to designing AI systems
and to theories of mind.
--Bob Moore
-------
∂29-Jan-85 2017 BH exclamation point in net address
To: JJW
CC: ME, JMC
Okay, I hacked MAIL to allow ! in an address at another host.
∂30-Jan-85 0856 NILSSON@SU-SCORE.ARPA Robotics Committee
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 08:56:07 PST
Date: Wed 30 Jan 85 08:55:10-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Robotics Committee
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
John, Would you consent to be on the search committee for
a "roboticist?" I will be an ex officio member and will play
an active role. Ideally, I would like you to be the chairman--but
that job entails making sure we follow all the correct procedures,
and writing up the papers on schedule in a manner prescribed by
the deanery. (I have heard from Mike Brady that he will apply--if
we keep his application confidential through the early screening
process at least.) Gene Golub has expressed an interest in being
on one of the committees--maybe we can get him to chair the
robotics one if you decline. --Nils
-------
∂30-Jan-85 0900 JMC*
money
∂30-Jan-85 0941 ARIADNE@SU-SCORE.ARPA CS colloquium: Despain Prolog Machine, Feb. 5
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 09:41:02 PST
Date: Wed 30 Jan 85 09:17:43-PST
From: Ariadne Johnson <ARIADNE@SU-SCORE.ARPA>
Subject: CS colloquium: Despain Prolog Machine, Feb. 5
To: ALL-COLLOQ@SU-SCORE.ARPA, TULEY@SU-SCORE.ARPA, FACULTY@SU-SCORE.ARPA,
MILTON@SRI-AI.ARPA, MORGENSTERN@SRI-CSL.ARPA
cc: ariadne@SU-SCORE.ARPA
Stanford-Phone: (415) 497-0872
CS 300 -- Computer Science Department Colloquium -- Winter 1984-1985.
Our fifth meeting will be
Tuesday, February 5π, 1985
at 4:15 in Terman Auditorium
THE BERKELEY PROLOG MACHINE
Alvin M. DESPAIN
Computer Science, Univ. of Calif.,Berkeley
ABSTRACT
The Berkeley Prolog Machine (PLM) is an experiment in high performance
architecture for executing logic programs. It is part of a longer term
effort, the Berkeley Aquarius project. The Aquarius project at Berkeley is
an on-going investigation whose ultimate research goal is to determine how
enormous improvements in performance can be achieved in a machine specialized
to calculate some very difficult "real" problems in design automation,
discrete simulation, systems, and signal processing. Our approach can be
characterized by three important points:
(1) Aquarius is to be a MIMD machine made of heterogeneous processing
elements, each of which is tailored to accommodate its own
individual processing requirements
(2) it is to exploit parallelism at all levels of execution, and
(3) it is to support logic-programming at the ISP level.
The presentation will include a discussion of the systems architecture of
Aquarius. The main discussion will focus on the Prolog Machine(PLM)
and will describe its key innova- tive features and development status.
Some performance estimates of the PLM as derived from simulation studies will
be presented.
-------------------------------->
Cookies, and if we can find a Juice-getting-volunteer, juice prior to the
colloquium, at 3:45 in the Margaret Jacks Hall Lounge.
---------------------------------------> see you there
$9
$9
-------
∂30-Jan-85 1000 JMC*
Brown letter
∂30-Jan-85 1007 LIBRARY@SU-SCORE.ARPA Idaho State University Conference on Automated Reasoning and Expert Systems
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 10:03:11 PST
Date: Wed 30 Jan 85 09:46:10-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Idaho State University Conference on Automated Reasoning and Expert Systems
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Idaho State University, Pocatello, Idaho, Dept. of Mathematics is sponsoring
their 8th miniconference in the area of Automated Reasoning and Expert
Systems. (Does anyone know if this means they have had 8 conferences on
automated reasoning or that only the 8th conference is devoted to automated
reasoning?) They have sent out a call for papers for the conference to
be held in Pocatello on April 26-27, 1984. The people to contact are
Larry Winter 208-236-2501 or Bob Girse 208-236-3819 Department of Math.
Idaho State University, Pocatello Idaho 83209. Dr. Ewing Lusk of the
Automated Reasoning Group at Argonne National Lab. will be the principal
speaker. Is anyone familiar with any of the research in this area
going on at Idaho State Univ.?
Harry Llull
-------
∂30-Jan-85 1015 @SU-SCORE.ARPA:FFL@SU-AI.ARPA Space Needs Review
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 10:15:12 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Wed 30 Jan 85 09:51:27-PST
Date: 30 Jan 85 0951 PST
From: Fran Larson <FFL@SU-AI.ARPA>
Subject: Space Needs Review
To: faculty@SU-SCORE.ARPA, FFL@SU-AI.ARPA
Between 9 and 10 a.m., Monday, February 11, Jacqueline Bryan from the Dean's
office, who is concerned with helping us plan for our new building, will be
taking a walking tour with me through our CSD facilities, including Jacks,
Cedar, and Welch Road. Jacqueline will be especially interested in the special
needs for space and its uses by the Department.
∂30-Jan-85 1051 @SU-SCORE.ARPA:FFL@SU-AI.ARPA Walking tour on space needs
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 10:51:07 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Wed 30 Jan 85 10:00:35-PST
Date: 30 Jan 85 1000 PST
From: Fran Larson <FFL@SU-AI.ARPA>
Subject: Walking tour on space needs
To: faculty@SU-SCORE.ARPA, FFL@SU-AI.ARPA
It will be Jaqueline and Nils who will be walking through our facilities.
∂30-Jan-85 1149 RA
Eric Ostrom 7-2607 called re 1. arranging computation for graduate students and
2. arranging for consulting professorship. Would like you to call him. If
he is not in, you can call his pager 858 9854.
∂30-Jan-85 1156 sun!aster!pratt@Berkeley re: parking
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 11:55:56 PST
Received: by UCB-VAX.ARPA (4.24/4.41)
id AB28216; Wed, 30 Jan 85 11:57:28 pst
Received: from aster.sun.uucp by sun.uucp (1.2/SMI-1.2)
id AA26953; Wed, 30 Jan 85 11:37:03 pst
Received: by aster.sun.uucp (4.24/3.14)
id AA10907; Wed, 30 Jan 85 11:41:29 pst
Date: Wed, 30 Jan 85 11:41:29 pst
From: sun!aster!pratt@Berkeley (Vaughan Pratt)
Return-Path: <pratt@aster>
Message-Id: <8501301941.AA10907@aster.sun.uucp>
To: JMC@SU-AI.ARPA
Subject: re: parking
Thanks. I had originally intended to contact Herrington, but made the
mistake of addressing my letter to the police dept. in general, which
merely referred me to the Palo Alto courthouse. Will follow your advice
not to behave rationally.
-v
∂30-Jan-85 1214 GOLUB@SU-SCORE.ARPA Re: Space Needs Review
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 12:14:07 PST
Date: Wed 30 Jan 85 12:11:45-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Re: Space Needs Review
To: FFL@SU-AI.ARPA, faculty@SU-SCORE.ARPA
In-Reply-To: Message from "Fran Larson <FFL@SU-AI.ARPA>" of Wed 30 Jan 85 09:51:00-PST
Do you want us to be sitting in our office to make it appear we are busy
working?
GENE
-------
∂30-Jan-85 1306 FFL
To: golub@SU-SCORE.ARPA, JMC@SU-AI.ARPA, FFL@SU-AI.ARPA
Maybe just busy being crawded.
∂30-Jan-85 1307 GOLUB@SU-SCORE.ARPA FORSYTHE LECTURE TONIGHT!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 13:07:50 PST
Date: Wed 30 Jan 85 12:58:11-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: FORSYTHE LECTURE TONIGHT!
To: faculty@SU-SCORE.ARPA
cc: su-bboards@SU-SCORE.ARPA, serra@SU-SCORE.ARPA, na-seminar@SU-SCORE.ARPA
The general FORSYTHE lecture will be given tonight at 7:30 in the
Terman Auditorium. The lecture will be given by Alan George and is
titled, " Solution of Large Sparse Sytems of Equations".
A reception at the Faculty Club follows the lecture.
GENE GOLUB
-------
∂30-Jan-85 1412 VAL grosof's work
Some time ago, you asked my opinion about it. I read recently his paper on
circumscription, and my impression was that he hasn't done anything significant
so far.
Vladimir
∂30-Jan-85 1421 REGES@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 14:21:00 PST
Date: Wed 30 Jan 85 14:20:17-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 27 Jan 85 15:27:00-PST
Office: Margaret Jacks 210, 497-9798
I maintain the list FACULTY@SCORE. Is there a problem?
-------
∂30-Jan-85 1424 RA
The flight on which you are waitlisted is still full. When you call PAN AM
in Vienna to reconfirm your flight back you should ask them about the waitlisted
flight. In case it clears, you should take an earlier flight to London so that
you can make the connection.
∂30-Jan-85 1505 REGES@SU-SCORE.ARPA Re: reply to message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jan 85 15:05:04 PST
Date: Wed 30 Jan 85 14:59:01-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Re: reply to message
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 30 Jan 85 14:55:00-PST
Office: Margaret Jacks 210, 497-9798
Okay, I'll fix the file. I was going to add Dick Gabriel anyway, so I'll do
both fixes right now.
-------
∂30-Jan-85 1646 RA
Sewalt Hodges (212) 425 1108 called he is from a research firm
which deals with AI.
∂31-Jan-85 0007 ERIC@SU-CSLI.ARPA Re: credit
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 31 Jan 85 00:07:35 PST
Date: Wed 30 Jan 85 15:38:43-PST
From: Eric Ostrom <ERIC@SU-CSLI.ARPA>
Subject: Re: credit
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 30 Jan 85 13:16:00-PST
Thanks! Have a nice trip.
-------
∂31-Jan-85 0839 BARWISE@SU-CSLI.ARPA Notes on yesterday's tea:
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 31 Jan 85 08:39:34 PST
Date: Thu 31 Jan 85 08:39:16-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Notes on yesterday's tea:
To: Israel@SU-CSLI.ARPA, john@SU-CSLI.ARPA, briansmith@SU-CSLI.ARPA,
etcHEMENDY@SU-CSLI.ARPA, jmc@SU-AI.ARPA, PENTLAND@SU-CSLI.ARPA,
bmoore@SRI-AI.ARPA, JEFFREY@SU-CSLI.ARPA, stan@SRI-AI.ARPA,
hobbs@SRI-AI.ARPA, halvorsen@SRI-AI.ARPA, NISSENBAUM@SU-CSLI.ARPA,
Moss@SU-CSLI.ARPA, Aczel@SU-CSLI.ARPA, Zalta@SU-CSLI.ARPA,
WITHGOTT@SU-CSLI.ARPA
Following are some notes on yesterday's tea. Feel free to add your
own cmments on the tea or on my summary of it. Then we will post in on
the bboard.
Date: Tue 29 Jan 85 14:06:02-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Tea Tomorrow
To: Researchers@SU-CSLI.ARPA
"Logic, Language and Information"
Wednesday Tea
Jan 30, 1985
3:30
They sound good together, but what, if anything, does logic have to do
with CSLI's real subject matter of language and information. Here are
some claims we have heard over the past 18 months: logic comes in
through logical form; logic is just the study of information; logic is
in the mind (or theory) of the designer (or theorist); all reasonable
representation languages can be embedded in first-order logic; logic
is needed to do the inferenceing needed to understand discourse. I
hope holders of each of these views, and others, will come prepared to
defend their views.
----------------
Mail-From: SF created at 29-Jan-85 20:50:19
Date: Tue 29 Jan 85 20:50:19-PST
From: Sol Feferman <SF@SU-CSLI.ARPA>
Subject: Re: Tea Tomorrow
To: BARWISE@SU-CSLI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Tue 29 Jan 85 14:06:45-PST
Wow! Unfortunately, ... I will probably have to miss most of the
discussion. But it is a tall order (the point of the discussion).
Practically all conscious human activity involves logic at some level
or other, and this holds implicitly for a certain amount of
unconscious activity. Try imagining any day-to-day activities without
the use of logic. Language is the medium of logic. There is no logic
without language, but not conversely. -------
---------
Notes on the tea:
Summary by Barwise:
Barwise began by trying to quote Feferman's message, and contrasting
it with a position he had taken in a paper. On the view expressed
there, logic is the study of valid inference, where inference is the
extraction of information. It is not restricted to language. Indeed,
any systematic activity has its own logic, and one can consider valid
inference in that domain. This is the common usage of "logic" in
phrases like "the logic of ...". On this view, what is called logic
in today's logic texts is just the logic of argument.
However, Barwise said that Israel had convinced him that this was an
imperialistic view, so that he was willing to go to the other extreme,
and consider pure logic, and pure inference, logic and inference that
is independent of subject matter. It would have to do with the most
general principles of valid inference: the valid extraction of
information implicit in situations. Such a view would not presuppose
that logic require language. Indeed, if Dretske is right that
information is prior to language, then pure logic would be prior to
the logic of argument. This was the sort of theory that Barwise took
situation theory to be.
Brian Smith asked about the relation between valid inference and sound
reasoning on this view. Barwise replied that valid inference would
have a role in sound reasoning, but the latter would be much more
general and difficult to understand.
Discussing Barwise's earlier position, not his later one, David Israel
argued for a view of logic that is more in line with the current view,
of logic as the logic of argument, and an abstraction over the use of
human language. One of his fears was that the more generous view of
logic would lead people to think that there are language-like systems
in nature where there are none, as in tree rings and the age of trees,
and lead to Derrida like talk of "reading nature". Another was respect
for the body of material that modern logic has build up from this
tradition.
...
Jumping ahead in our reporting, Brian Smith later asked what sort of
objects logical properties were properties of. In particular, do they
apply to physical things like written or spoken utterances. Israel
denied this, saying that logic abstracted away from all this. Perry
asked, give the very loose correspondence between the structure
logicians called language that logical properties were properties of,
and real linguistic events, how could he be sure that it was language
at all, but not more a study of pure logic in the sense Barwise had
mentioned? Following up on this, Stan Rosenschein asked us to imagine
that arguments were coded up by numbers, and asked whether the
properties of numbers that arose from logical truths were logical
properties of the numbers. Israel admitted they would be. Stan
seemed to be suggesting that even if this were true, it would not make
the numbers anything that deserved to be called a language. Israel,
never at loss for a reply, had one that escapes me now.
In the middle of the above discussion (as indicated by the ...), there
was another discussion. John McCarthy asked whether people thought
that first-order logic was a reasonable tool for the representation of
knowledge in practical computer systems, with reasoning being done by
theorem proving? Barwise expressed his deep scepticism about this
approach. Asked for reasons, he mentioned three: one being the great
difficulty even in mathematics (a deductive science) of transforming
discover and proof into anything like a formal system, another the
known limitations of first-order logic, and yet another being the
brittle nature of all deductive formal systems. McCarthy countered by
describing a new theorem prover that was able to accept a new proof of
the Church-Rosser theorem, which left Barwise unmoved.
Bob Moore argued that people who doubted the power of formal systems
were really being chauvinistic toward machines, and that things like
the independence of the continuum hypothesis were suggestive of the idea
that people did indeed embody a formal system. John Etchemedny
pointed out that one could well imagine that people were limited in
the same way that machines were, without thinking that reasoning was
anything like derivability in a formal system.
Smith asked what about the non-monotonicity of reasoning, which McCarthy
has worked on. This led McCarthy to propose the following challenge:
there should be a raise to find a general reasoning system that could
solve the following problem. The family dogs keep knocking over the
garbage cans, until someone in the family thinks of putting a hook on
the side of the house and hanging the cans from the hooks. McCarthy
pointed out this solution would not work if dogs had the properties of
chimps, so that non-monotonic reasoning will be probably required at
some point, to see that the solution will work, since part of the
reasoning consists of deciding that one has thought of all the relevant
contingencies. McCarthy admitted that he did not know how to do this
under the deduction model of reasoning, but he was working on it.
Dick Jeffrey found it astounding to think that anyone would think that
anything like logical deduction was what led one to such discoveries.
At this point, Sandy Pentland gave a neat example. Consider the
problem of finding the shortest path on a fish net between two
arbitrary knots. Looked at deductively, this is, he said, an
NP-complete problem (i.e., hard to solve in real time). However
it is actually easy to solve by just hanging the net from the two
knots. Couldn't it be that certain forms of reasoning are more like
the latter than the former?
This led to a heated exchange about the logic of fish nets, until
McCarthy used the rhetorical devise of leaving to catch a plane for
Europe. This was not to be taken as a sign of capitulation.
Speaking of Pentland, at an earlier point he complained that on all
the views of logic present. Valid inference, whether it presupposed
language or not, only preserved truth. What about the concern with
knowing whether the hypotheses (and hence conclusion) of a valid
inference was true? Israel responded that of he was right, that was
the whole point, but that it was not part of what logic concerned
itself with. That was why people (like Pentland) who are concerned
with perception, are crucial to the whole enterprise, even if they are
not logicians.
Somewhere along about here the logicians left to go to the logic (F2)
seminar. Amazingly, the whole issue of logical form, and whether the
notion has any place in a theory of language (as opposed to a model of
linguistic activity) never came up. Maybe we need a tea on just that
issue?
Later comments by the participants:
-------
∂31-Jan-85 0844 BARWISE@SU-CSLI.ARPA notes on yesteday's tea
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 31 Jan 85 08:44:40 PST
Date: Thu 31 Jan 85 08:42:57-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: notes on yesteday's tea
To: researchers@SU-CSLI.ARPA
Anyone who was at the tea yesterday should have gotten a first draft of
some notes on the tea. If you were there and did not get them, let me
know.
-------
∂31-Jan-85 1038 AAAI-OFFICE@SUMEX-AIM.ARPA List of Officers and former officers
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 31 Jan 85 10:38:28 PST
Date: Thu 31 Jan 85 10:39:49-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: List of Officers and former officers
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody Bledsoe ai.woody@mcc President 84-85
MCC
9430 Research Blvd
Austin, TX 78767
Ron Brachman brachman@sri-kl Councilor 84-87
Sclumberger-CAS Research
3340 Hillview
Palo Alto, CA 94304
Bruce G. Buchanan 415:497-0935 membership 79-
Computer Science Department 321-2561 home councilor 79-81
Stanford University buchanan@sumex
Stanford, CA 94305
Eugene Charniak councilor 83-6
Computer Science Department
Brown University
Providence, RI 02912
Randall Davis councilor 83-6
MIT-AI Laboratory Tutorial Chair
545 Technology Square krd@mit-mc '85
Cambridge, MA 02139
Robert Engelmore 415:327-6600 editor AI Mag 81-
Teknowledge
525 University Avenue bengelmore@sri-kl
Palo Alto, CA 94301
Lee D. Erman 415:327-6600 publications 79-
Teknowledge, Inc. councilor 79-80
525 University Avenue lerman@sri-kl
Palo Alto, CA 94301
Michael R. Genesereth 415:497-0324 councilor 82-5
Computer Science Department program 83
Stanford University csd.genesereth@score
Stanford, CA 94305
Peter E. Hart 415:325-9339 councilor 82-5
Syntelligence
800 Oak Grove Ave, Suite 201 hart@sri-kl
Menlo Park, CA 94025
John McCarthy 415:497-4430 president 83-4
Computer Science Department councilor 80-2
Stanford University jmc@su-ai
Stanford, CA 94305
John McDermott mcdermott@cmu-cs-a Councilor 84-87
Computer Science Dept
Carnegie-Mellon University
Pittsburgh, PA 15213
D. Raj Reddy 412:578-2597 councilor 79-81 82-5
Computer Science Department 683-8779 home finance 80-
Carnegie-Mellon University reddy@cmua
Pittsburgh, PA 15213
Charles Rich rich@mit-mc councilor 84-87
MIT AI Lab
545 Technology Sq
Cambridge, MA 02139
Charles J. Rieger 703:476-6100 councilor 81-4
Scion
12310 Pinecrest Road
Reston, VA 22091
Stanley J. Rosenschein 415:859-4167 councilor 82-3 83-6
Artificial Intelligence Center
SRI International stan@sri-ai
Menlo Park, CA 94025
Edward Shortiffe, TC117 Shortliffe@sumex Councilor 84-87
Stanford Medical Center
Stanford, CA 94305
Mark Stefik councilor 83-6
Xerox PARC
3333 Coyote Hill Road stefik@parc
Palo Alto, CA 94304
Gerald J. Sussman 617:253-5874 councilor 81-4
MIT AI Laboratory
545 Technology Square gjs@mit-ai
Cambridge, MA 02139
Jay M. Tenenbaum 415:496-4699 conference 80-
Sclumberger-CAS Research Tenenbaum@sri-kl
3340 Hillview St.
Palo Alto, CA 94304
Patrick H. Winston 617:253-6218 councilor 79-81
MIT-AI Laboratory President 85-
545 Technology Square phw@mit-mc President-elect
Cambridge, MA 02139 84-85
! FORMER AAAI OFFICIALS
Robert M. Balzer 213-822-1511 program 80
USC/ISI
4676 Admiralty Way balzer@isif
Marina del Rey, CA 90291
Daniel G. Bobrow 415:494-4438 councilor 80-83
Xerox PARC
3333 Coyote Hill Road bobrow@parc
Palo Alto, CA 94304
Scott Fahlman 412:578-2575 local 1982
Computer Science Department
Carnegie-Mellon University fahlman@cmuc
Pittsburgh, PA 15213
Edward A. Feigenbaum 415:497-4079 president 80-1
Computer Science Department 493-5618 home
Stanford University feigenbaum@sumex
Stanford, CA 94305
Jerome A. Feldman 716:275-5478 councilor 80-2
Computer Science Department
University of Rochester feldman@sumex
Rochester, NY 14627
Barbara J. Grosz 415:859-4839 councilor 81-4
Artificial Intelligence Center
SRI International grosz@sri-ai
Menlo Park, CA 94025
Frederick Hayes-Roth 415:327-6600 tutorials 80 81
Teknowledge
525 University Avenue rhayes-roth@sri-kl
Palo Alto, CA 94301
Douglas Lenat tutorial 84
Computer Science Department
Stanford University
Stanford, CA 94305
Drew McDermott 203:436-4771 councilor 80-83
Computer Science Department
Yale University mcdermott@yale
New Haven, CT 06520
Marvin Minsky 617:253-5864 president 81-2
MIT-AI Laboratory councilor 80-1
545 Technology Square minsky@mit-mc
Cambridge, MA 02139
Nils J. Nilsson 415:859-7735 president 82-3
Artificial Intelligence Center 854-5265 home councilor 79-1
SRI International nilsson@sri-ai
Menlo Park, CA 94025
Allen Newell 412:578-2602 president 79-80
Computer Science Department 421-3668 home
Carnegie-Mellon University newell@cmua
Pittsburgh, PA 15213
Charles Rich 617-253-7877 tutorials 82 83
MIT AI Laboratory, Rm 342 643-7465 home and Councilor 84-87
545 Technology Square rich@mit-ai
Cambridge, MA 02139
Earl D. Sacerdoti 408:737-7960 councilor 79-81
Machine Intelligence 415:325-4119 home
330 Potrero Avenue sacerdoti@sri-kl
Sunnyvale, CA 94086
Herbert A. Simon 412:578-2787 councilor 80-2
Department of Psychology
Carnegie-Mellon University simon@cmua
Pittsburgh, PA 15213
Alan M. Thompson editor AI Mag 80-1
Donald E. Walker 201-582-7406 sec-treas 79-83
Bell Communications Research
435 South St.
Morristown, NJ 07960
David L. Waltz 217:333-6071 councilor 79-80 81-3
Thinking Machines Inc. program 82
Walham, MA
Bonnie L. Webber 215:243-7745 councilor 81-4
Computer & Information Science
University of Pennsylvania bonnie.upenn@udel
Philadelphia, PA 15213
Terry Winograd 415:497-2273 councilor 80-1
Computer Science Department
Stanford University tw@su-ai
Stanford, CA 94305 winograd@parc
William A. Woods 617:497-3361 councilor 81-2
Bolt Beranek and Newman
50 Moulton Street woods@bbng
Cambridge, MA 02238
-------
∂31-Jan-85 1244 @SU-SCORE.ARPA:WALESON@SUMEX-AIM.ARPA Lou Fein
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Jan 85 12:44:16 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Thu 31 Jan 85 12:43:30-PST
Date: Thu 31 Jan 85 11:39:21-PST
From: Anthea Waleson <WALESON@SUMEX-AIM.ARPA>
Subject: Lou Fein
To: Nilsson@SU-SCORE.ARPA, Mccarthy@SU-SCORE.ARPA, Knuth@SU-SCORE.ARPA,
Feigenbaum@SUMEX-AIM.ARPA
cc: waleson@SUMEX-AIM.ARPA
A colleague in the library has recently encountered Lou Fein who
has volunteered to help collecting archival materials documenting
the history of computer science in this area. He has asked me
what I know about Mr. Fein who has made some large claims about
his experience. Do you have any information? Recollections?
Thanks.
Bruce Buchanan (sent by Waleson, sec.)
-------
∂01-Feb-85 0903 BARWISE@SU-CSLI.ARPA Topics for tea?
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Feb 85 09:03:46 PST
Date: Fri 1 Feb 85 09:02:00-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Topics for tea?
To: Researchers@SU-CSLI.ARPA
Anyone have anything that they think would be fun to discuss at tea
next Wednesday?
-------
∂01-Feb-85 0912 NILSSON@SU-SCORE.ARPA Re: Lou Fein
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 Feb 85 09:12:32 PST
Date: Fri 1 Feb 85 09:11:04-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: Lou Fein
To: WALESON@SUMEX-AIM.ARPA
cc: Mccarthy@SU-SCORE.ARPA, Knuth@SU-SCORE.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Anthea Waleson <WALESON@SUMEX-AIM.ARPA>" of Thu 31 Jan 85 12:43:32-PST
I know Lou Fein. He likes to spend 99% of his time on the
"meta problem" and the rest on the problem. That means, with
regard to libraries, that he would spend most of his time
arguing about what the policy ought to be on collecting materials
and precious little time collecting the materials. Still and all,
Lou is an old and good friend and I enjoy chatting with him from
time to time. Maybe he would agree to help informally and infrequently
through a few casual conversations. -Nils
-------
∂01-Feb-85 1517 RA
Van Wallach is writing a book about hi-tech careers. Needs information about
AI. His tel. (718) 875 9828
∂01-Feb-85 1519 RA
A Mike Benedict looks for information about voice to print out module.
Who can help him out?
∂01-Feb-85 1522 RA
Judith Turner from Chronicle of Higher Education (202) 466 1063 would like
to talk to you re a story on Roger Shank's book
∂01-Feb-85 1532 RA
Statement of income from University of Maryland on your desk.
∂01-Feb-85 1656 SJG counterfactuals
Dear John:
I have had a look at Ascribing Mental Qualities to Machines, and feel
ready to talk to you, if you've managed to have another shot at my stuff.
In any event, I was really impressed with what you wrote, and suggested
that the informal meeting of Mike, me, and Mike's students that takes
place on Mondays discuss it next time we meet (the 4th, at 4pm). Care
to join us?
Hope you can parse that last sentence. See you soon -
Matt
∂01-Feb-85 1705 RA
The library book you asked for is on your desk.
∂02-Feb-85 1051 RPG Machine decision
To: JMC, CLT, les-here
I feel comfortable with the Sequent machine. I suggest we put it in the
proposal - in fact, I think someone would have to make a pretty convincing
argument to me to make me change my mind.
Joe has the latest quote, which is for two different machine
configurations. Possibly we should get both configurations. I also think
that Kahn can strike a deal with Sequent for a better price - I simply
decided not to try to do that myself.
-rpg-
∂03-Feb-85 1540 NILSSON@SU-SCORE.ARPA CS224
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Feb 85 15:40:12 PST
Date: Sun 3 Feb 85 15:38:56-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: CS224
To: jmc@SU-AI.ARPA, genesereth@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA,
binford@SU-AI.ARPA, winograd@SU-AI.ARPA, manna@SU-SCORE.ARPA,
wiederhold@SU-SCORE.ARPA, buchanan@SUMEX-AIM.ARPA,
shortliffe@SUMEX-AIM.ARPA
cc: nilsson@SU-SCORE.ARPA
In putting together a list of lecturers for CS224 this spring, it seems
that you folks ought to be given a first choice on picking a time and
topic--only if you want to, of course. The lecture series will be on
Thursdays from 11:00 until 12:15 starting with April 4, 1985--and
continuing until May 30. (I think June 6 is the first day of
final exams.)
Please respond with a date(s) and lecture title(s). [A list of the
Thursdays that you could NOT lecture would be most helpful.] Also,
if you happen to know about eminences who will be visiting Stanford
in the Spring and who might be appropriate for giving a lecture, please
let me know (with dates if known). Also, any suggestions for
"musts" (other than yourselves) would be appreciated.
The main purpose of the lecture series is to provide our students
with a cross section of what's important, current, exciting in
AI research these days.
Thanks, -Nils
-------
∂03-Feb-85 1742 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 3 February 1985
Previous Balance 4.18
Monthly Interest at 1.5% 0.06
Current Charges 2.80 (vending machine)
-------
TOTAL AMOUNT DUE 7.04
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
Your last Pony payment was recorded on 10/13/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂04-Feb-85 0812 RA
I don't feel well and will not be able to come in today.
∂04-Feb-85 0828 JOHN@SU-CSLI.ARPA metaphorical meaning
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Feb 85 08:28:44 PST
Date: Mon 4 Feb 85 08:28:30-PST
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: metaphorical meaning
To: researchers@SU-CSLI.ARPA
A very bright undergraduate is doing his senior thesis with me on
analogical arguments and related issues. Is anyone at CSLI interested
in issues like metaphorical meaning, analogy, and the like, who is
willing to discuss such issues with this student?
-------
∂04-Feb-85 0956 BMOORE@SRI-AI.ARPA Re: [John McCarthy <JMC@SU-AI.ARPA>: logic and ai ]
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 4 Feb 85 09:55:54 PST
Date: Mon 4 Feb 85 09:54:49-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: Re: [John McCarthy <JMC@SU-AI.ARPA>: logic and ai ]
To: BARWISE@SU-CSLI.ARPA, john@SU-CSLI.ARPA, jmc@SU-AI.ARPA
cc: BMOORE@SRI-AI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Mon 4 Feb 85 08:35:35-PST
The next F4 meeting is going to be a discussion that will overlap
considerably with the questions John McCarthy has raised. Namely, we
are going to discuss the arguments for a "representationalist"
approach to building robots and modelling mental states. This won't,
however, concentrate on the technical issues of whether first-order
logic or some other system is appropriate, given that one has chosen a
representational approach. It seems to me that F2 would be an
appropriate place to discuss the interpretation of various results on
the limitations of first-order logic.
-------
∂04-Feb-85 1107 VAL strips
You were absolutely right, it's not so easy to explain STRIPS in terms of
situation calculus. STRIPS is a very strange beast indeed, and at a certain
point I didn't even understand how it can possibly work at all. But now it
seems clear again. Let's talk about it some time.
--Vladimir
∂04-Feb-85 1114 HI.RICH@MCC.ARPA Re: fantasy finally
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 4 Feb 85 11:14:34 PST
Date: Mon 4 Feb 85 13:16:06-CST
From: Elaine Rich <HI.RICH@MCC.ARPA>
Subject: Re: fantasy finally
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 4 Feb 85 01:12:00-CST
Elaine Rich (72)
8603 Altus Cove
Austin, Texas 78759
I got another issue of the magazine last week and it had more letters on
the subject but they were so boring I couldn't even read all of them.
Something lighter is definitely in order.
Elaine
-------
∂04-Feb-85 1707 CLT meeting
rpg and les will come tomorrow at 4 (here)
∂04-Feb-85 2044 JJW Thesis
I'd like to discuss progress on my thesis with you sometime this week.
Some ideas of mine are similar to those of Halstead's Multilisp, but I
may be able to develop them in a different direction.
I also have a form from the Hertz Foundation (fellowship renewal) that
needs your signature.
∂04-Feb-85 2116 JJW Sequent
To: JMC@SU-AI.ARPA, LES@SU-AI.ARPA, RPG@SU-AI.ARPA, CLT@SU-AI.ARPA,
cheriton@SU-PESCADERO.ARPA
I don't think anyone has given a report of our trip to Sequent yet. They
are definitely a real company, and are producing and selling their machines.
The hardware is approximately the same as Synapse and Encore, but is
available (unlike Encore at present) and runs Unix (unlike Synapse, whose
operating system isn't as good), though Synapse has a more sophisticated
cache and both of the others have a faster memory bus. Sequent seems as
interested in our work as Encore, much more so than Synapse.
It's my understanding that we intend to propose buying two Sequent machines
to ARPA, since Synapse, being more expensive, might reduce the chance of
the proposal being accepted. We were given a revised price quote that is
about $290K for 12 processors and 16Mbytes, and $310K for 8 processors and
24Mbytes. (In each case this is the maximum amount of memory that can be
put on the machine.) The exact figures are on a sheet that I gave to
Rutie, and I asked her to make copies for JMC and LES.
Note that these prices include $65K for a Dynix source license. I got the
impression that they would actually rather not sell us the sources, since
they are trying to keep their multiprocessor improvements to Unix
confidential. If we could run without operating system changes, or if we
could get them to make any necessary changes before shipping it to us, we
would save a substantial amount. The only changes to the kernel that I
could think of were for IP/TCP (Stanford subnet routing). Jeff Mogul has
told me that we may be able to run without changes because of a feature in
our Ethernet gateways, and eventually there will be a subnet routing
standard that Sequent may be convinced into supporting. Our discussions
about implementing Qlambda did not uncover any necessary changes in the
operating system. Shared memory between processes is now available as a
system-wide resource (i.e. you could have one multiprocessor Lisp job
running at any time), and by September they will have a more flexible
version of shared segments so that several users can do it simultaneously.
When deciding how many processors and how much memory to get, keep in mind
that the virtual address space of any process is at most 16Mbytes (24 bits).
A single user running Qlambda might benefit more from 12 processors vs. 8
than from 24Mbytes vs. 16, since the extra memory couldn't be part of his
address space. (It would allow the entire user program as well as the
operating system to reside in memory. I forgot to ask how much memory
Dynix takes up.)
The prices don't include any terminals, nor an Ethernet transceiver. We
might want to buy only one terminal for an operator console, and use Telnet
as the primary means of access. (Similarly for the machine to be used at
Lucid, I assume.) I forget whether their quote was for a 1/4" cartridge
tape or a 1/2" tape, but we might want to change that as well. These are
all rather small items however.
∂05-Feb-85 0636 NILSSON@SU-SCORE.ARPA Robotics Committee
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Feb 85 06:36:10 PST
Date: Tue 5 Feb 85 06:36:20-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Robotics Committee
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
John, Jim Gibbons and I agreed that Bob Cannon should be the
chairman of the robotics faculty search committee. I suspect you
won't be disappointed about that. I would very much like you
to be on the committee though to make sure that its recommendations
are based on high academic standards. The other committee members
will be Tom Binford and me (and possibly someone from M.E.)
-------
∂05-Feb-85 0825 NILSSON@SU-SCORE.ARPA CS224
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Feb 85 08:25:31 PST
Date: Tue 5 Feb 85 08:25:32-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: CS224
To: jmc@SU-AI.ARPA, rpg@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
I have John McC's offer to talk in CS 224 about "Commonsense Knowledge
and Reasoning in Logic." How about one of you talking about
Qlambda? (Richard, CS224 this spring is going to be a one-unit
lecture series featuring current AI research topics. Thursdays,
11-12:15). -Nils
-------
∂05-Feb-85 1044 DAVIES@SU-SIERRA.ARPA Berkeley workshop
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 5 Feb 85 10:44:16 PST
Date: Tue, 5 Feb 1985 10:45 PST
Message-ID: <DAVIES.12085305480.BABYL@SU-SIERRA.ARPA>
From: DAVIES@SU-SIERRA.ARPA
To: AAP@SUMEX, JMC@SAIL
Subject: Berkeley workshop
cc: Davies@SU-SIERRA.ARPA
Al Despain is leading a workshop next week at Berkeley on combined
symbolic and numeric computing. Parallelism is not the focus of the
workshop, but will be discussed (e.g., Bert Halstead of MIT, who told
me about the workshop, and who is developing a multiprocessor Lisp,
will be attending).
Is anyone from our group going?
-- Byron
∂05-Feb-85 1057 RA
Hi Rutie,
Sue Thompson of TX Inst - called John Mc about an Art Intell satellite -
would like to talk about possible receive station.
also Judith Turner, of Chronicle of Higher Education, would like interview
for story on AI.
Sue Thompson 415-392-5701
Judith Turner 202-466-1063
thanks, Kim
-------
∂05-Feb-85 1145 RPG Berkeley workshop
To: aap@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
∂05-Feb-85 1045 @SUMEX-AIM.ARPA:DAVIES@SU-SIERRA.ARPA Berkeley workshop
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Feb 85 10:45:18 PST
Received: from SU-SIERRA.ARPA by SUMEX-AIM.ARPA with TCP; Tue 5 Feb 85 10:44:25-PST
Date: Tue, 5 Feb 1985 10:45 PST
Message-ID: <DAVIES.12085305480.BABYL@SU-SIERRA.ARPA>
From: DAVIES@SU-SIERRA.ARPA
To: AAP@SUMEX, JMC@SAIL
Subject: Berkeley workshop
cc: Davies@SU-SIERRA.ARPA
Al Despain is leading a workshop next week at Berkeley on combined
symbolic and numeric computing. Parallelism is not the focus of the
workshop, but will be discussed (e.g., Bert Halstead of MIT, who told
me about the workshop, and who is developing a multiprocessor Lisp,
will be attending).
Is anyone from our group going?
-- Byron
I will go to part of it.
∂05-Feb-85 1228 VAL formalization of strips
It seems to me again that you need ∀xyzu(on(x,y)=on(z,u) ⊃ x=z & y=u). In
connection with the STRIPS axiom, you'll need formulas like
¬deleted(on(a,b),move(c,d),s0), and for that purpose you'll need
∀x(on(a,b)≠on(c,x)).
If you agree to drop the "if" part in the STRIPS axiom, then you can also drop
the precondition terms in the definitions of delete and add.
It's confusing that you use "a" both for actions and blocks.
∂05-Feb-85 1248 VAL additional axiom for strips
I take it back. Everything seems ok.
∂05-Feb-85 1447 perlis@tove bibliography
Received: from TOVE.ARPA by SU-AI.ARPA with TCP; 5 Feb 85 14:47:09 PST
Received: by tove.ARPA (4.12/4.7)
id AA10494; Tue, 5 Feb 85 17:49:34 est
Date: Tue, 5 Feb 85 17:49:34 est
From: Don Perlis <perlis@tove>
Message-Id: <8502052249.AA10494@tove.ARPA>
To: jmc@su-ai
Subject: bibliography
At last I found an online copy of the file, in a place I had forgotten!
Below is the raw nroff version. I will also send a clean version in a
separate message. I am also going to merge this bibliography with one
being prepared by a colleague in Kaiserslautern, a fellow named
Michael Reinfrank, as well as correcting numerous errors in the file
as it stands.
.nf
Bibliography of literature on non-monotonic reasoning
Compiled by D. Perlis
University of Maryland
College Park, MD 20742
301-454-7933
(perlis@maryland)
.fi
The following references have been compiled with the help of many persons.
Since not all of the items have been available for me to examine, there will
be some unevenness in the selection. Often I have had to make a decision for
or against inclusion based on the title alone. Also for the same reason, some
of the entries have missing data, especially dates. The choice was either to
exclude such items altogether, in the interests of a more polished
appearance, or to include them in the interests of somewhat greater
usefulness.
.sp 3
.np
Aida, H., Tanaka, H., and Moto-oka, T. [1983] A PROLOG extension for handling negative knowledge. New Generation Computing, 1 (1), 87ff.
.np
Besnard, Ph., Quiniou, R., and Quinton, P. [1983] A theorem-prover for a decidable subset of default logic. Proc. AAAI-83, pp. 27-30.
.np
Bossu, G. and Siegel, P. [1981] La saturation au secours de la non-monotonic (Where the saturation rescues the non-monotony). Marseilles, France.
.np
Bossu, G. and Siegel, P. Saturation, nonmonotonic reasoning, and the closed-world assumption. To appear, Artificial Intelligence.
.np
Brachman, R.J. [1982?] I lied about the trees. Unpublished, Fairchild Lab for AI Research.
.np
Clark, K. [1978] Negation as failure. In: Logic and Databases, Gallaire, H. and Minker, J. (eds.). Plenum Press, New York, pp. 293-322.
.np
Cohen, P., and Grinberg, M. [1983] A framework for heuristic reasoning about uncertainty. Proc. 8th IJCAI, pp. 355-357.
.np
Creary, L. [1981] On the epistemology of commonsense factual reasoning: beyond anti-logicism and non-monotonicity. Stanford University.
.np
Davis, M. [1980] The mathematics of non-monotonic reasoning. Artificial Intelligence, 13 (1,2), pp. 73-80.
.np
Dempster, A. [1967] Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Statistics, 38, pp. 325-339.
.np
Doyle, J. [1977] Truth maintenance systems for problem solving. Proc. 5th IJCAI, p. 247.
.np
Doyle, J. [1979] A glimpse of truth maintenance. Proc. 6th IJCAI, pp. 232-237.
.np
Doyle, J. [1979] A truth maintenance system. Artificial Intelligence, 12. 231-272.
.np
Doyle, J. [1981] Non-monotonic logics and mechanized non-deductive reasoning. Stanford University.
.np
Doyle, J. [1982] Some theories of reasoned assumptions: An essay in rational
psychology. Carnegie-Mellon University.
.np
Doyle, J. [1983] The ins and outs of reason maintenance. Proc. 8th IJCAI, pp. 349-351.
.np
Doyle, J. and London, P. [????] A selected descriptor-indexed bibliography to the literature on belief revision. MIT AI Memo 568.
.np
Etherington, D. [1982] Finite default theories. MSc Thesis, University of British Columbia.
.np
Etherington, D. [1983] Formalizing non-monotonic reasoning systems. University of British Columbia, Dept. of Computer Science, Tech. Report 83-1.
.np
Etherington, D. and Reiter, R. [1983] On inheritance hierarchies with exceptions. Proc. AAAI-83, pp. 104-108.
.np
Etherington, D., Mercer, R., and Reiter, R. [1984] On the adequacy of predicate circumscription for closed-world reasoning. University of British Columbia, Dept. of Computer Science, Tech. Report 84-5.
.np
Fahlman, S., Touretzky, D., and Van Roggen, W. [1981] Cancellation in a parallel semantic network. Proc. 7th IJCAI, pp. 257-263.
.np
Gabbay, D. [1982] Intuitionistic basis for non-monotonic logic. Lecture Notes in Computer Science, Vol. 139, Springer.
.np
Gabbay, D. [1984] N-PROLOG! An extension of PROLOG with causal implications. Research Report, Imperial College of Science and Technology, London.
.np
Gabbay, D. [1984] Theoretical foundations for non-monotonic reasoning in expert systems. Research Report Draft, Imperial College of Science and Technology, London.
.np
Gabbay, D. [1984] What is negation in a system and when is failure a negation? Imperial College of Science and Technology, London.
.np
Gabbay, D. and Sergot, M. [1984] Negation as inconsistency. Research Report Doc. 84/7.
.np
Ginsberg, M. [????] Non-monotonic reasoning using Dempster's Rule. (??)
.np
Grant, J. and Minker, J. [1984] Answering queries in indefinite databases and the null value problem. Tech. Report 1374, University of Maryland.
.np
Haas, A. [1981] Reasoning about deduction with unknown constants. Proc. 7th
IJCAI, pp. 382-384.
.np
Israel, D. [1980] What's wrong with non-monotonic logic? Proc. AAAI-80, pp.
99-101.
.np
Konolige, K. [1982] Circumscriptive ignorance. Proc. AAAI-82, pp. 202-204.
.np
Konolige, K. [1984] Belief and incompleteness. SRI Tech. Note 319.
.np
Kowalski, R. [1978] Logic for data description. In: Logic and Databases, Gallaire, H. and Minker, J. (eds.). Plenum Press, New York, pp. 77-103.
.np
Kowalski, R. [1979] Logic for Problem Solving. North-Holland, New York.
.np
Kramosil, I. [1975] A note on deduction rules with negative premises. Proc. 4th IJCAI, pp. 53-56.
.np
Levesque, H. [1981] Incompleteness in knowledge bases. SIGART Newsletter 74, p. 150ff.
.np
Levesque, H. [1981] The interaction with incomplete knowledge bases: a formal treatment. Proc. 7th IJCAI, pp. 240-245.
.np
Levesque, H.J. [1982] A formal treatment of incomplete knowledge. Fairchild Lab for AI Research, Tech. Report 3.
.np
Lifschitz, V. [1983] A special case of circumscription. University of Texas, El Paso.
.np
Lifschitz, V. [????] On non-monotonic reasoning. Tech. Report, University of Texas.
.np
Lifschitz, V. [????] A logic for non-monotonic reasoning, with application to
Minsky's bird problem. University of Texas, El Paso.
.np
Lifschitz, V. [????] Reflections on circumscription. Stanford University.
.np
Lipski, W. [1977] On the logic of incomplete information. Lecture Notes in Computer Science, v.53, Springer, pp. 374-381. (6th Symposium on Mathematical Foundations of Computer Science)
.np
Lukaszewicz, W. [1983] General approach to nonmonotonic logics. Proc. 8th IJCAI, pp. 352-354.
.np
Lukaszewicz, W. [1984] Non-monotonic logic for default theories. Submitted to ECAI-6.
.np
Martins, J. [1983] Reasoning in multiple belief spaces. PhD thesis, SUNY at Buffalo, Computer Science Tech. Report 203.
.np
Martins, J. and Shapiro, S. [1983] Reasoning in multiple belief spaces. Proc. 8th IJCAI, pp. 370-373.
.np
Marek, W. [????] The forcing interpretation of the non-monotonic logic. Department of Computer Science, University of Kentucky.
.np
McAllester, D. [1978] A three-valued truth maintenance system. MIT AI Lab Memo 473.
.np
McAllester, D. [1980] An outlook on truth maintenance. MIT AI Lab Memo 551.
.np
McAllester, D. [1982] Reasoning utility package user's manual, version 1. MIT AI Lab Memo 667.
.np
McCarthy, J. [1980] Circumscription--a form of non-monotonic reasoning. Artificial Intelligence, 13 (1,2), pp. 27-39.
.np
McCarthy, J. [1980] Addendum: circumscription and other non-monotonic formalisms. Artificial Intelligence, 13 (1,2), pp. 171-172.
.np
McCarthy, J. [1984] Applications of circumscription to formalizing common sense knowledge. Stanford University.
.np
McCarthy, J. and Hayes, P. [1969] Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, Meltzer, B. and Michie, D. (eds.), Edinburgh University Press.
.np
McDermott, D. [1982] Temporal logic for reasoning about proceses and plans. Cognitive Science, 6 (2), pp. 101-155.
.np
McDermott, D. [1982] Non-monotonic logic II: non-monotonic modal theories. Journal of the ACM, 29 (1), pp. 33-57.
.np
McDermott, D. and Doyle, J. [1980] Non-monotonic logic I. Artificial Intelligence, 13 (1,2), pp. 41-72.
.np
Mercer, R. and Reiter, R. [1982] The representation of presuppositions using defaults. University of British Columbia, Technical Report 82-1.
.np
Mercer, R. and Rosenberg, R.S. [1984] Generating corrective answers by computing presuppositions of answers, not questions, or Mind your P's, not Q's. Proc CSCSI-84, pp16-18.
.np
Minker, J. [1982] On indefinite databases and the closed-world assumption. Lecture Notes in Computer Science, v. 138, pp. 292-308, Springer. (6th Conference on Automated Deduction).
.np
Minker, J. [1983] On theories of definite and indefinite databases. Tech. Report, University of Maryland.
.np
Minker, J. and Perlis, D. [1984] On the semantics of circumscription. Tech. Report, University of Maryland.
.np
Minker, J. and Perlis, D. [1984] Applications of protected circumscription. Lecture Notes in Computer Science, v. 170, pp. 414-425, Springer. (7th Conference on
Automated Deduction).
.np
Minker, J. and Perlis, D. [1984] Circumscription: Finitary completeness results. Draft.
.np
Minker, J. and Perlis, D. [1984] Protected circumscription. Draft.
.np
Minsky, M. [1974] A framework for representing knowledge. MIT AI Lab Memo 306.
.np
Moore, R. [1975] Reasoning from incomplete knowledge in a procedural deduction system. MIT AI Lab Memo 347.
.np
Moore, R. [1983] Semantical considerations on non-monotonic logic. SRI TN 284.
.np
Moore, R. [1983] Semantical considerations on non-monotonic logic. Proc. 8th IJCAI, pp. 272-279.
.np
Nau, D. and Reggia, J. Relationships between deductive and abductive inference in knowledge-based diagnostic problem-solving. Draft, University of Maryland.
.np
Nourani, C. [1983] Equational intensity, initial models, and AI reasoning. GTE Laboratories, Waltham, MA.
.np
Nutter, J. [1983] Default reasoning in AI systems. MSc Thesis, SUNY at Buffalo, Computer Science Tech. Report 204.
.np
Nutter, J. [1983] Default reasoning using monotonic logic: a modest proposal. Proc. AAAI-83, pp. 297-300.
.np
Nutter, J. [1983] What else is wrong with nonmonotonic logics? Representational and
informational shortcomings. Proc. 5th Cognitive Science Conference, Rochester.
.np
Pena, L. [1980] The philosophical relevance of a contradictorial system of logic. Proc. 10th Int'l Symposium on Multiple-valued Logic, pp. 238-252.
.np
Perlis, D. [1984] Non-monotonicity and real-time reasoning. Draft.
.np
Reiter, R. [1978] On closed world databases. In: Logic and Databases, Gallaire, H. and Minker, J. (eds.), Plenum, pp. 55-76.
.np
Reggia, J. and Nau, D. [1984] An abductive non-monotonic logic. Draft.
.np
Reiter, R. [1978] On reasoning by default. Proc TINLAP-2, Urbanna, Ill.
.np
Reiter, R. [1980] Equality and domain closure in first-order databases. Journal of the ACM 27 (2), pp. 235-249.
.np
Reiter, R. [1980] A logic for default reasoning, Artificial Intelligence 13 (1,2), pp. 81-132.
.np
Reiter, R. [1982] circumscription implies predicate completion (sometimes). Proc. AAAI-82, pp. 418-420.
.np
Reiter, R. and Criscuolo, G. [1981] On interacting defaults. Proc. 7th IJCAI, pp. 270-276.
.np
Reiter, R. and Criscuolo, G. [1983] Some representational issues in default reasoning. Int. J. Computers and Mathematics (special issue on computational linguistics.
.np
Rescher, N. [1976] Plausible Inference. Van Gorcum, Assen, The Netherlands.
.np
Rich, E. [1983] Default reasoning as likelihood reasoning. Proc AAAI-83.
.np
Sandewall, E. [1972] An approach to the frame problem and its implementation. Machine Intelligence 7.
.np
Sandewall, E. [1983] Partial models, attribute propogation systems, and non-monotonic semantics. Linkoping University. LITH-IDA-R-83-01.
.np
Shafer, G. [1976] A Mathematical Theory of Evidence. Princeton Univ. Press.
.np
Stalnaker, R. [1980] A note on non-monotonic modal logic. Dept. of Philosophy, Cornell University.
.np
Touretzky, D. [1984] Implicit ordering of defaults in inheritance systems. Submitted to AAAI-84.
.np
Touretzky, D. [1984] The mathematics of inheritance systems. Ph.D. Thesis, Carnegie-Mellon University.
.np
Vere, S. [1980] Multi-level counterfactuals for generalizations of relational concepts and productions. Artificial Intelligence, 14 (2), pp. 139-164.
.np
Webber, B. [1983?] Logics and natural language. University of Pennsylvania.
.np
Weyhrauch, R. [1980] Prolegomena to a theory of mechanized formal reaoning Artificial Intelligence, 13 (1,2), pp. 133-170.
.np
Winograd, T. [1980] Extended inference modes in reasoning by computer systems. Artificial Intelligence 13 (1,2), pp. 5-26.
.np
Zadeh, L. [1979] Fuzzy sets and information granularity. In: Advances in Fuzzy Set Theory, Gupta, M., Ragade, R., and Yager, R., (eds.). North-Holland, Amsterdam, pp. 3-18.
∂05-Feb-85 1452 perlis@tove biblio clean version
Received: from TOVE.ARPA by SU-AI.ARPA with TCP; 5 Feb 85 14:52:17 PST
Received: by tove.ARPA (4.12/4.7)
id AA10554; Tue, 5 Feb 85 17:54:47 est
Date: Tue, 5 Feb 85 17:54:47 est
From: Don Perlis <perlis@tove>
Message-Id: <8502052254.AA10554@tove.ARPA>
To: jmc@su-ai
Subject: biblio clean version
Bibliography of literature on non-monotonic reasoning
Compiled by D. Perlis
University of Maryland
College Park, MD 20742
301-454-7933
(perlis@maryland)
The following references have been compiled with the help of
many persons. Since not all of the items have been avail-
able for me to examine, there will be some unevenness in the
selection. Often I have had to make a decision for or
against inclusion based on the title alone. Also for the
same reason, some of the entries have missing data, espe-
cially dates. The choice was either to exclude such items
altogether, in the interests of a more polished appearance,
or to include them in the interests of somewhat greater use-
fulness.
(1) Aida, H., Tanaka, H., and Moto-oka, T. [1983] A PROLOG
extension for handling negative knowledge. New Genera-
tion Computing, 1 (1), 87ff.
(2) Besnard, Ph., Quiniou, R., and Quinton, P. [1983] A
theorem-prover for a decidable subset of default logic.
Proc. AAAI-83, pp. 27-30.
(3) Bossu, G. and Siegel, P. [1981] La saturation au
secours de la non-monotonic (Where the saturation res-
cues the non-monotony). Marseilles, France.
(4) Bossu, G. and Siegel, P. Saturation, nonmonotonic rea-
soning, and the closed-world assumption. To appear,
Artificial Intelligence.
(5) Brachman, R.J. [1982?] I lied about the trees. Unpub-
lished, Fairchild Lab for AI Research.
(6) Clark, K. [1978] Negation as failure. In: Logic and
Databases, Gallaire, H. and Minker, J. (eds.). Plenum
Press, New York, pp. 293-322.
$9
$9
(7) Cohen, P., and Grinberg, M. [1983] A framework for
heuristic reasoning about uncertainty. Proc. 8th IJCAI,
pp. 355-357.
(8) Creary, L. [1981] On the epistemology of commonsense
factual reasoning: beyond anti-logicism and non-
monotonicity. Stanford University.
(9) Davis, M. [1980] The mathematics of non-monotonic rea-
soning. Artificial Intelligence, 13 (1,2), pp. 73-80.
(10) Dempster, A. [1967] Upper and lower probabilities
induced by a multivalued mapping. Ann. Math. Statis-
tics, 38, pp. 325-339.
(11) Doyle, J. [1977] Truth maintenance systems for problem
solving. Proc. 5th IJCAI, p. 247.
(12) Doyle, J. [1979] A glimpse of truth maintenance. Proc.
6th IJCAI, pp. 232-237.
(13) Doyle, J. [1979] A truth maintenance system. Artificial
Intelligence, 12. 231-272.
(14) Doyle, J. [1981] Non-monotonic logics and mechanized
non-deductive reasoning. Stanford University.
(15) Doyle, J. [1982] Some theories of reasoned assumptions:
An essay in rational psychology. Carnegie-Mellon
University.
(16) Doyle, J. [1983] The ins and outs of reason mainte-
nance. Proc. 8th IJCAI, pp. 349-351.
(17) Doyle, J. and London, P. [????] A selected descriptor-
indexed bibliography to the literature on belief revi-
sion. MIT AI Memo 568.
(18) Etherington, D. [1982] Finite default theories. MSc
Thesis, University of British Columbia.
$9
$9
(19) Etherington, D. [1983] Formalizing non-monotonic rea-
soning systems. University of British Columbia, Dept.
of Computer Science, Tech. Report 83-1.
(20) Etherington, D. and Reiter, R. [1983] On inheritance
hierarchies with exceptions. Proc. AAAI-83, pp. 104-
108.
(21) Etherington, D., Mercer, R., and Reiter, R. [1984] On
the adequacy of predicate circumscription for closed-
world reasoning. University of British Columbia, Dept.
of Computer Science, Tech. Report 84-5.
(22) Fahlman, S., Touretzky, D., and Van Roggen, W. [1981]
Cancellation in a parallel semantic network. Proc. 7th
IJCAI, pp. 257-263.
(23) Gabbay, D. [1982] Intuitionistic basis for non-
monotonic logic. Lecture Notes in Computer Science,
Vol. 139, Springer.
(24) Gabbay, D. [1984] N-PROLOG! An extension of PROLOG
with causal implications. Research Report, Imperial
College of Science and Technology, London.
(25) Gabbay, D. [1984] Theoretical foundations for non-
monotonic reasoning in expert systems. Research Report
Draft, Imperial College of Science and Technology, Lon-
don.
(26) Gabbay, D. [1984] What is negation in a system and when
is failure a negation? Imperial College of Science and
Technology, London.
(27) Gabbay, D. and Sergot, M. [1984] Negation as incon-
sistency. Research Report Doc. 84/7.
(28) Ginsberg, M. [????] Non-monotonic reasoning using
Dempster's Rule. (??)
(29) Grant, J. and Minker, J. [1984] Answering queries in
indefinite databases and the null value problem. Tech.
Report 1374, University of Maryland.
(30) Haas, A. [1981] Reasoning about deduction with unknown
constants. Proc. 7th IJCAI, pp. 382-384.
(31) Israel, D. [1980] What's wrong with non-monotonic
logic? Proc. AAAI-80, pp. 99-101.
(32) Konolige, K. [1982] Circumscriptive ignorance. Proc.
AAAI-82, pp. 202-204.
(33) Konolige, K. [1984] Belief and incompleteness. SRI
Tech. Note 319.
(34) Kowalski, R. [1978] Logic for data description. In:
Logic and Databases, Gallaire, H. and Minker, J.
(eds.). Plenum Press, New York, pp. 77-103.
(35) Kowalski, R. [1979] Logic for Problem Solving. North-
Holland, New York.
(36) Kramosil, I. [1975] A note on deduction rules with
negative premises. Proc. 4th IJCAI, pp. 53-56.
(37) Levesque, H. [1981] Incompleteness in knowledge bases.
SIGART Newsletter 74, p. 150ff.
(38) Levesque, H. [1981] The interaction with incomplete
knowledge bases: a formal treatment. Proc. 7th IJCAI,
pp. 240-245.
(39) Levesque, H.J. [1982] A formal treatment of incomplete
knowledge. Fairchild Lab for AI Research, Tech. Report
3.
(40) Lifschitz, V. [1983] A special case of circumscription.
University of Texas, El Paso.
(41) Lifschitz, V. [????] On non-monotonic reasoning. Tech.
Report, University of Texas.
(42) Lifschitz, V. [????] A logic for non-monotonic reason-
ing, with application to Minsky's bird problem.
University of Texas, El Paso.
(43) Lifschitz, V. [????] Reflections on circumscription.
Stanford University.
(44) Lipski, W. [1977] On the logic of incomplete informa-
tion. Lecture Notes in Computer Science, v.53,
Springer, pp. 374-381. (6th Symposium on Mathematical
Foundations of Computer Science)
(45) Lukaszewicz, W. [1983] General approach to nonmonotonic
logics. Proc. 8th IJCAI, pp. 352-354.
(46) Lukaszewicz, W. [1984] Non-monotonic logic for default
theories. Submitted to ECAI-6.
(47) Martins, J. [1983] Reasoning in multiple belief spaces.
PhD thesis, SUNY at Buffalo, Computer Science Tech.
Report 203.
(48) Martins, J. and Shapiro, S. [1983] Reasoning in multi-
ple belief spaces. Proc. 8th IJCAI, pp. 370-373.
(49) Marek, W. [????] The forcing interpretation of the
non-monotonic logic. Department of Computer Science,
University of Kentucky.
(50) McAllester, D. [1978] A three-valued truth maintenance
system. MIT AI Lab Memo 473.
(51) McAllester, D. [1980] An outlook on truth maintenance.
MIT AI Lab Memo 551.
(52) McAllester, D. [1982] Reasoning utility package user's
manual, version 1. MIT AI Lab Memo 667.
(53) McCarthy, J. [1980] Circumscription--a form of non-
monotonic reasoning. Artificial Intelligence, 13 (1,2),
pp. 27-39.
$9
$9
(54) McCarthy, J. [1980] Addendum: circumscription and other
non-monotonic formalisms. Artificial Intelligence, 13
(1,2), pp. 171-172.
(55) McCarthy, J. [1984] Applications of circumscription to
formalizing common sense knowledge. Stanford Univer-
sity.
(56) McCarthy, J. and Hayes, P. [1969] Some philosophical
problems from the standpoint of artificial intelli-
gence. In Machine Intelligence 4, Meltzer, B. and
Michie, D. (eds.), Edinburgh University Press.
(57) McDermott, D. [1982] Temporal logic for reasoning about
proceses and plans. Cognitive Science, 6 (2), pp.
101-155.
(58) McDermott, D. [1982] Non-monotonic logic II: non-
monotonic modal theories. Journal of the ACM, 29 (1),
pp. 33-57.
(59) McDermott, D. and Doyle, J. [1980] Non-monotonic logic
I. Artificial Intelligence, 13 (1,2), pp. 41-72.
(60) Mercer, R. and Reiter, R. [1982] The representation of
presuppositions using defaults. University of British
Columbia, Technical Report 82-1.
(61) Mercer, R. and Rosenberg, R.S. [1984] Generating
corrective answers by computing presuppositions of
answers, not questions, or Mind your P's, not Q's. Proc
CSCSI-84, pp16-18.
(62) Minker, J. [1982] On indefinite databases and the
closed-world assumption. Lecture Notes in Computer Sci-
ence, v. 138, pp. 292-308, Springer. (6th Conference on
Automated Deduction).
(63) Minker, J. [1983] On theories of definite and indefin-
ite databases. Tech. Report, University of Maryland.
(64) Minker, J. and Perlis, D. [1984] On the semantics of
circumscription. Tech. Report, University of Maryland.
(65) Minker, J. and Perlis, D. [1984] Applications of pro-
tected circumscription. Lecture Notes in Computer Sci-
ence, v. 170, pp. 414-425, Springer. (7th Conference on
Automated Deduction).
(66) Minker, J. and Perlis, D. [1984] Circumscription: Fin-
itary completeness results. Draft.
(67) Minker, J. and Perlis, D. [1984] Protected circumscrip-
tion. Draft.
(68) Minsky, M. [1974] A framework for representing
knowledge. MIT AI Lab Memo 306.
(69) Moore, R. [1975] Reasoning from incomplete knowledge in
a procedural deduction system. MIT AI Lab Memo 347.
(70) Moore, R. [1983] Semantical considerations on non-
monotonic logic. SRI TN 284.
(71) Moore, R. [1983] Semantical considerations on non-
monotonic logic. Proc. 8th IJCAI, pp. 272-279.
(72) Nau, D. and Reggia, J. Relationships between deductive
and abductive inference in knowledge-based diagnostic
problem-solving. Draft, University of Maryland.
(73) Nourani, C. [1983] Equational intensity, initial
models, and AI reasoning. GTE Laboratories, Waltham,
MA.
(74) Nutter, J. [1983] Default reasoning in AI systems. MSc
Thesis, SUNY at Buffalo, Computer Science Tech. Report
204.
(75) Nutter, J. [1983] Default reasoning using monotonic
logic: a modest proposal. Proc. AAAI-83, pp. 297-300.
(76) Nutter, J. [1983] What else is wrong with nonmonotonic
logics? Representational and informational shortcom-
ings. Proc. 5th Cognitive Science Conference, Roches-
ter.
(77) Pena, L. [1980] The philosophical relevance of a con-
tradictorial system of logic. Proc. 10th Int'l Sympo-
sium on Multiple-valued Logic, pp. 238-252.
(78) Perlis, D. [1984] Non-monotonicity and real-time rea-
soning. Draft.
(79) Reiter, R. [1978] On closed world databases. In:
Logic and Databases, Gallaire, H. and Minker, J.
(eds.), Plenum, pp. 55-76.
(80) Reggia, J. and Nau, D. [1984] An abductive non-
monotonic logic. Draft.
(81) Reiter, R. [1978] On reasoning by default. Proc
TINLAP-2, Urbanna, Ill.
(82) Reiter, R. [1980] Equality and domain closure
in first-order databases. Journal of the ACM 27
(2), pp. 235-249.
(83) Reiter, R. [1980] A logic for default reasoning, Artif-
icial Intelligence 13 (1,2), pp. 81-132.
(84) Reiter, R. [1982] circumscription implies predi-
cate completion (sometimes). Proc. AAAI-82, pp.
418-420.
(85) Reiter, R. and Criscuolo, G. [1981] On interacting
defaults. Proc. 7th IJCAI, pp. 270-276.
(86) Reiter, R. and Criscuolo, G. [1983] Some representa-
tional issues in default reasoning. Int. J. Computers
and Mathematics (special issue on computational
linguistics.
(87) Rescher, N. [1976] Plausible Inference. Van Gorcum,
Assen, The Netherlands.
(88) Rich, E. [1983] Default reasoning as likelihood reason-
ing. Proc AAAI-83.
$9
$9
(89) Sandewall, E. [1972] An approach to the frame problem
and its implementation. Machine Intelligence 7.
(90) Sandewall, E. [1983] Partial models, attribute propoga-
tion systems, and non-monotonic semantics. Linkoping
University. LITH-IDA-R-83-01.
(91) Shafer, G. [1976] A Mathematical Theory of Evidence.
Princeton Univ. Press.
(92) Stalnaker, R. [1980] A note on non-monotonic modal
logic. Dept. of Philosophy, Cornell University.
(93) Touretzky, D. [1984] Implicit ordering of defaults in
inheritance systems. Submitted to AAAI-84.
(94) Touretzky, D. [1984] The mathematics of inheritance
systems. Ph.D. Thesis, Carnegie-Mellon University.
(95) Vere, S. [1980] Multi-level counterfactuals for gen-
eralizations of relational concepts and productions.
Artificial Intelligence, 14 (2), pp. 139-164.
(96) Webber, B. [1983?] Logics and natural language.
University of Pennsylvania.
(97) Weyhrauch, R. [1980] Prolegomena to a theory of mechan-
ized formal reaoning Artificial Intelligence, 13 (1,2),
pp. 133-170.
(98) Winograd, T. [1980] Extended inference modes in reason-
ing by computer systems. Artificial Intelligence 13
(1,2), pp. 5-26.
(99) Zadeh, L. [1979] Fuzzy sets and information granular-
ity. In: Advances in Fuzzy Set Theory, Gupta, M.,
Ragade, R., and Yager, R., (eds.). North-Holland,
Amsterdam, pp. 3-18.
$9
$9
∂05-Feb-85 1622 RA
Sara called earlier, but I forgot to tell you. She says that it's not really
important. Will try to call later.
∂05-Feb-85 1629 RA
I put a statement of Misc. Income from MIT on your desk.
∂05-Feb-85 2323 SG My father-in-law / Japan
To: JMC
CC: SG
My father-in-law, Dr.Sogo Okamura, heard that you will visit Japan in June.
He would like to invite you to his home for dinner.
If you have already made your plan in Japan, please let me know it. I will
forward your message to my father.
(*) Dr.Okamura is *now* the director general at JSPS: Japan Society for the
Promotion of Science.
∂05-Feb-85 2335 FY LISP machine in #324
To: bosack@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, YM@SU-AI.ARPA
I talked with John McCarthy about which lisp machine terminal he'd
prefer to give him.
He says that the one currently in room #302 is the one to move.
Thanks.
-- Frank Yellin
∂06-Feb-85 0802 perlis@tove slithy things
Received: from TOVE.ARPA by SU-AI.ARPA with TCP; 6 Feb 85 08:02:23 PST
Received: by tove.ARPA (4.12/4.7)
id AA16364; Wed, 6 Feb 85 11:04:58 est
Date: Wed, 6 Feb 85 11:04:58 est
From: Don Perlis <perlis@tove>
Message-Id: <8502061604.AA16364@tove.ARPA>
To: jmc@su-ai
Subject: slithy things
John, it shouldn't have been so much trouble to send you the
bibliography; I carelessly deleted a directory some time ago
that had the bibliography in it. Then yesterday I realized I
still had a copy in another file. Normally I too would keep
such a thing on line.
Our three main machines here are mimsy (also known as maryland),
tove, and gymble. The former two are VAXes, the latter a Pyramid.
All run Unix and all are on the Arpanet. I have my mail from mimsy
and gymble forwarded to tove, so it matters not where paople choose
to send to me (perlis@mimsy(maryland)/tove/gymble is all the same).
Clearly there is a Lewis Carroll influence. I think it started when
a student observed that since the Pyramid is in the North Gym (and
not in our CS bldg) then a good name for it would be gymble, and
the rest followed from that.
Regards,
Don
P.S. Did you get the paper Jack and I sent? We'd appreciate comments.
∂06-Feb-85 0935 BOSACK@SU-SCORE.ARPA Re: LISP machine in #324
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Feb 85 09:35:36 PST
Date: Wed 6 Feb 85 09:38:48-PST
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: LISP machine in #324
To: FY@SU-AI.ARPA
cc: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, YM@SU-AI.ARPA, Tom@SU-SCORE.ARPA
In-Reply-To: Message from "Frank Yellin <FY@SU-AI.ARPA>" of Tue 5 Feb 85 23:35:00-PST
OK, we'll do it. Our students are scarce this week due to midterms, but I
expect we can do something next week.
Len
-------
∂06-Feb-85 1000 JMC*
vts,industry,hcn,dinosaur
∂06-Feb-85 1015 LIBRARY@SU-SCORE.ARPA A Sociological Look at AI Research
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Feb 85 10:15:28 PST
Date: Wed 6 Feb 85 10:03:24-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: A Sociological Look at AI Research
To: su-bboards@SU-SCORE.ARPA
cc: JMC@SU-AI.ARPA, eaf@SU-AI.ARPA, buchanan@SUMEX-AIM.ARPA,
: ;
The following is the introduction to an article by James Fleck which appeared
in Sociology of the Sciences, Volume VI, 1982, pp.169-217. The title of the
article is Development and Establishment in Artificial Intelligence.
In this paper, I discuss the role played by scientific establishments in the
development of a particular scientific specialty, Artificial Intelligence, a
computer-related area which takes as its broad aim, the construction of computer
programs that model aspects of intelligent behaviour. As with any discussion
of a scientific specialty, the identification of what is involved is not
unproblematic, and the above serves as an indication rather that a definition.
While the term Artificial Intelligence is used in a variety of ways, there is
a discernable group (perhaps approaching the degree of commonality to be called
a community) of researchers who recognize the term as descriptive of a certain
sort of work, and who, if they themselves are not willing to be directly
labelled by the term, can locate themselves with respect to it.
Unfortunately, there is little or no commonly available literature that
systematically charts the scope of this area. It is worthwhile, therefore,
to consider the distinctive socio-congintive characteristics of research in
AI as a prelude to a fairly specific discussion of the social and institutional
processes involved in the development of the area, thus providing a basis
for exploring the usefulness and applicabiligy of the concept of establishment.
The article includes an interesting chart showing the movement of AI researchers
during the 1960's and 1970's among the main centers of AI research: SRI, CMU,
Stanford, and MIT. If you are interested in this article, I have a copy
of it in the Math/CS Library
Harry Llull
-------
∂06-Feb-85 1704 RA
1. Dennis Bart returned your call.
2. Richard Gordon from UC Santa Cruz called re strategic computing conference.
Would like you to call him tomorrow morning (408) 425 1865. If you call between
10:30 and 12:30, call (408) 429 4484
∂06-Feb-85 1701 KUO Reference
To: JMC
CC: KUO
I'm invited by Dr.Adrian Walker for a short visit to the IBM Research Center in the
coming summer. I would appreciate very much if you would send a letter of reference
on my behalf to the following address:
Dr.Adrian Walker
20-108
IBM Thomas J.Watson Research Center
P.O.Box 218
Yorktown Heights,NY 10598
----Victor
∂06-Feb-85 1736 BSCOTT@SU-SCORE.ARPA McCarthy ARPA Contract
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Feb 85 17:36:09 PST
Date: Wed 6 Feb 85 17:27:50-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: McCarthy ARPA Contract
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, TOB@SU-AI.ARPA, DCL@SU-AI.ARPA,
Wiederhold@SUMEX-AIM.ARPA
cc: BScott@SU-SCORE.ARPA
You will all recall that funds were redistributed in November of 1983 so that
all research could continue, pending receipt of a new contract. At that time
Binford and Luckham each contributed $27,500 to McCarthy and Wiederhold to
tide them over ($15,000 went to McCarthy and $40,000 went to Wiederhold). Ron
Ohlander told both Luckham and Binford that another task would have to be in-
cluded on the new contract to include the equipment which they would not be
able to buy on the old contract, due to this redistribution of funds.
From this understanding that Ohlander had with Luckham and Binford, I am
assuming that Luckham and Binford did not expect to get the money back from
the old contract. I need to have this point confirmed before I make final
arrangements to clear the overdrafts in all accounts, except McCarthy's.
McCarthy's will not be cleared, since he is the only one on the continuing
contract. There will be no transfers made, but rather the overdrafts to
be cleared will be handled by McCarthy making direct charges to the new
contracts of the other P.I.'s until it all balances. I expect to keep
a very precise accounting of these transactions, and will keep everyone
informed.
As stated above, before I do anything, I need to know whether everyone agrees
that Binford and Luckham will each request $27,500 in new funding on their
current contracts as was told to both them and to me by Ron Ohlander.
If any of this is not clear, or if you want to meet to discuss it, please
let me know. I want to get this taken care of just as soon as possible
since a total overdraft of $391,930 has to be cleared by direct charges
to other accounts.
Thanks very much,
Betty
-------
∂06-Feb-85 2000 JOHN@SU-CSLI.ARPA Memorandum
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 6 Feb 85 20:00:23 PST
Date: Wed 6 Feb 85 19:59:15-PST
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: Memorandum
To: initiators@SU-CSLI.ARPA
K
To: Initiators at CSLI
From: John Perry
Subject: The future of CSLI and SL
As Jon has indicated, I will take over as Director of CSLI this
Spring. Jon will continue to be PI on the SL grant, and in that role
he will contiune to have a number of the duties he has been assuming
as director. This memo is an attempt to articulate how I see things
and what directions I expect to try to move CSLI in.
Although the future will see a sharper distinction between CSLI and
the SL grant, the two are of course quite interwoven. So it is
important to note that this perspective is shared by Jon. I think it
is also deemed reasonable, to varying degrees, by the other members of
the executive committee, Barbara Grosz, Stanley Peters, and Brian
Smith, and by the Associate and Assistant Directors, Tom Wasow and
Betsy Macken.
Basically, it seems to me that we have been successful in two related
but separate endeavors.
A. We have established CSLI as a world class center of research
activity; a place with which many researchers with many different
perspectives want to have some contact-- from a computer account to a
permanent position-- and spend some time, --from an afternoon to a
sabbatical to the forseeable future.
B. We have gotten a start on the integrated effort a developing a
science of language and information through the multiplicity of
interrelated research projects envisaged in the proposal, and new
projects that have emerged from the interactions.
I find it important to keep A and B separated in my thinking. They
are at least logically independent. We might succeed in establishing
CSLI as the nerve center for the worldwide language and information
research community, while failing to make good on the research goals
we put forward. Or we might succeed completely with our reseach
goals, while the world fails to notice CSLI. I am not very worried
about the latter happening, but I am concerned that the former might.
One would not expect many generalizations to hold good over the range
of research projects enunciated in the proposal, but I have the sense
that a couple might come close. I think most of us feel we have made
considerble progress over the last year and a half, and that the
facilities, staff and environment of CSLI have been crucial. But few
of us think that we are near our research goals. I, for one, see much
more clearly many of the difficulties in the projects I am involved
in, I'm thinking about the problems in different terms, and am in a
position to get somewhere with them. This is progress, but it's not
being on the threshhold of success. My sense from seminars, talking
with others, and the reprots to the research committee is that many
others feel something like this about their own work.
It is important, then, that we ensure ourselves that we have the
resources to continue working until we get to a point at which the
accomplishmenmts of CSLI research, and not just the success in
establishing the CSLI environment, can serve as a solid basis for
additional funding. Unfortunately, I just do not believe we are a
mere two years from that point.
The original proposal, you will recall, was for something like 40
million for 8 or 9 years. We got about half of that, for four years.
Spreading the amount we got over the longer period of time was not an
option originally, but now it is one that SDF has explicitly
recognized. Indeed, I think the SDF Board would be pleased were we
able to do this. Jon and I plan, therefore, to think in terms of
spreading the funds available after the current academic year over
four additional years.
We would like the various research teams, the "pre-existing" ones and
the new constellations that have and are developing, to think
realistically about their research plans for the next four years.
In particular, we would like to get a sense of the concrete (in the
rather abstract sense of "concrete" appropriate to
our theory-oriented Center) accomplishments that the
researchers can foresee in that period of time, and the sort of support
that will be necessary from the SL grant to achieve them.
We do not have in mind detailed research proposals and budgets, but
rather shortish memos that can serve as the basis for frank discussions,
which can lead to a plan for research and fund-raising for the the
next four years.
Getting back to the distinction between A and B, it is important that
we not shortchange B. We do want to continue to have CSLI support
general activities benefitting the wider language and information
community. But we do not want to undercut the funding of the work of
the researchers whose ideas and efforts led to the establishment of
CSLI, for the real value and importance of CSLI will rest on their
accomplishments.
This will mean that the CSLI operation will have to become somewhat
leaner and more efficient than it is at present, and that money for
visitors, colloquia, good will, and the generally accessible
computational environment will have to be carefully weighed against
the needs of the researchers. Since the operation to date reflects
extremely rapid growth and some plans no longer suited to our
forseeable future income, I do not think this will be an impossible
task. It will be done humanely.
I hope that we can underspend our budget this year significantly, and
that by mid-Spring we can have a fairly concrete idea of how CSLI
can continue as a thriving Center on a budget that uses considerably
less than three million per year of SL funds.
In addition to the research plans outlined above, we will need to have
a good grip on two other factors. The first is the computational
environment. At present we own a large number of dandelions, some
fated to soon become dandetigers, several Vaxes, and a Dec, plus a lot
of other miscellaneous equipment. We have all sorts of needs, all
sorts of users, and all sorts of ideas. From this welter of
expensive-to-run- and-maintain riches, we need to select the
essentials of our computational environment of the future. This
environment will be a good one, I assure you, but each element in it
will be supported only to the extent that it makes compared to
alternative uses--graduate students, summer support, key visitors,
staff, etc.--to which the relevant funds could be put. I hope we can
reach a consensus on this, but whether we do or not, we will have firm
plans by the beginning of Summer.
The second factor, on which I at least need to have a better grip, is
the proper way to mix A-oriented and B-oriented activities. There is
an ambiguity about much of what we do. Meetings designed to be small
groups of researchers, making progress on specific research goals, tend
to turn into large colloquia--worthwile events, to be sure. But one
should not feel one has to get away from Ventura to get some work done.
We have made progress on conceptualizing just how the Center should
work, to fulfill both of its functions, but there is more progress to
be made.
To both evangilize the above point of view, improve it, and work
towards consensus, Jon and I had planned to spend a great deal of time
this quarter meeting in small groups of researchers, in preparation
for taking over this Spring. A large teaching schedule has gotten in
the way of these plans thus far, but I had hoped to get busy once I
had made it past the unfamiliar Augustine and Aquinas in my Western
Culture course, and gotten to Descartes, a near contemporary
(practically a member of the f4).
Now some rather severe and time and emotion consuming personal
problems have cropped up (my youngest son has committed a
burglary, and is in jail.) Still, I hope to start
meeting soon with these groups. Please, then, talk, discuss and plan
about these issues, and I will try to talk to you soon.
-------
-------
∂06-Feb-85 2311 SG My father-in-law (addendum)
To: JMC
CC: SG
Thank you very much for your acceptance of my father-in-law's invitation.
He knows the schedule of NSF-JSPS seminar (June 18: Opening ceremony at Tsukuba,
Two-day seminar at Numazu, ...).
Because he will be busy on June 22. He would like to invite you on June 17 (Mon)
or June 21 (Fri) or another convenient day among your additional days in Japan.
∂07-Feb-85 0830 JOHN@SU-CSLI.ARPA p.s.
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Feb 85 08:30:33 PST
Date: Thu 7 Feb 85 08:30:17-PST
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: p.s.
To: initiators@SU-CSLI.ARPA
Be sure to include, in your thinking about SL research over the next
four years, the contributions of non-initiators who have become
intimately involved in research projects.
-------
∂07-Feb-85 0900 JMC*
Ward report from Stanford News Service 7-2558
∂07-Feb-85 0937 AI.WOODY@MCC.ARPA Your Visit
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 7 Feb 85 09:37:04 PST
Date: Thu 7 Feb 85 11:38:29-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Your Visit
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
John,
I have on my calander a visit for you to MCC next Friday and Saturday.
Let me know if you would like reservations made for you etc, your time of
arrival if you would like someone to pick you up at the airport.
I have a note from Boy Boyer stating that Carolyn is coming the last
week of February. I presume that she and you are coming separately (and
not that I have confused the dates).
If you have worked out your proof of a decision procedure for
Monatic Logic I would be pleased to see it before you come. Also I
could touch base with John Minor about your proof, to see whether
something like has been published. He is (or was) an expert in this
area.
Best regards,
Woody
-------
∂07-Feb-85 1458 AAAI@SRI-AI.ARPA Draft Amendment
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 7 Feb 85 14:58:41 PST
Date: Thu 7 Feb 85 14:59:23-PST
From: name AAAI-OFFICE <AAAI@SRI-AI.ARPA>
Subject: Draft Amendment
To: Ai.woody@MIT-MC.ARPA, JMC@SU-AI.ARPA, Fikes@USC-ECL.ARPA, PHW@MIT-MC.ARPA
cc: aaai@SRI-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Below is a draft amendment to the AAAI By-Laws regarding the
extension of the terms of the President and President-elect.
If you would care to comment on it, please do.
I thought I would send it out at the end of the month.
Regards,
Claudia
PETITION TO AMEND THE BY-LAWS
of the
AMERICAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE
Any amendment, addition and/or deletion to the By-Laws of the
American Association for Artificial Intelligence requires
the approval of the members of the association.
On August 9, 1984, the AAAI Executive Council voted to extend the term
of the President and the President-elect from one year to two years
(see Article V. Officers, Section 2. Election and Term of Office).
At this time, the Executive Council asks the membership to vote on
this amendment.
←←←←← Yes, extend the terms to two years.
←←←←← No, maintain the terms to one year.
Name ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
Date ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
Please return this ballot to the AAAI Office by May 1, 1985.
Thank you
-------
∂07-Feb-85 1531 SMC phone msg
Bonnie Knabe from Lawrence-Livermore security called, please call her at
422-7469 ASAP reguarding clearence.
422-7469 ASAP reguarding clearance.
∂07-Feb-85 1808 LLW@S1-A.ARPA Interview Appointment
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 7 Feb 85 18:08:02 PST
Date: 07 Feb 85 1759 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Interview Appointment
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
John, one of the secretaries in the Lab's Security Department reported
that she is attempting to contact you to set up an interview for next
Tuesday. I have been away from my office all day, but my lead secretary
gave her your Stanford office and home telephone numbers (and left me a
note to this effect). I presume that they've made contact with you by
now. Lowell
∂07-Feb-85 1947 avg@diablo re: Russell Baker on Word Processing (from SAIL's BBOARD)
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 7 Feb 85 19:47:15 PST
Date: Thu, 7 Feb 85 19:49:15 pst
From: Allen VanGelder <avg@diablo>
Subject: re: Russell Baker on Word Processing (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
I think you left out a comma.
∂07-Feb-85 2357 SF@SU-CSLI.ARPA Re: NSF travel grant to Japan
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Feb 85 23:57:01 PST
Date: Thu 7 Feb 85 23:58:17-PST
From: Sol Feferman <SF@SU-CSLI.ARPA>
Subject: Re: NSF travel grant to Japan
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 7 Feb 85 21:04:00-PST
Great! Thanks for the news. Sol
-------
∂08-Feb-85 0256 LES
Here are draft budgets for the overall project and for the two subcontracts.
I guess that this stuff should be treated as confidential.
Current words are in PROP[PUB,LES], which is unprotected. Alas,
I lost the pointer to RPG's proposal prose so it isn't there yet.
I'll dig that up tomorrow. If you don't see anything grossly wrong,
I'll ask Betty Scott to have a look tomorrow.
Incidentally, I don't have the actual staff benefit rates for U.C. Berkeley
yet, so that part is hand-waving.
---------------------------------------------------------------------
Budget
Three years beginning 1 June 1985.
Budget for year 1 2 3
beginning 6-1-85 6-1-86 6-1-87
Personnel
Prof. John McCarthy, Principal Investigator 19,713 19,713 19,713
(15% acad. yr., 50% summer)
Lester Earnest, Project Manager (100%) 67,500 67,500 67,500
Carolyn Talcott, Research Associate (100%) 43,000 43,000 43,000
-----, Computer Systems Analyst (100%) 40,000 40,000 40,000
-----, Student Research Assistant 12,600 12,600 12,600
(50% acad. yr., 100% summer)
-----, Student Research Assistant 12,600 12,600 12,600
(50% acad. yr., 100% summer)
-----, Student Research Assistant 12,600 12,600
(50% acad. yr., 100% summer)
-----, Student Research Assistant 12,600 12,600
(50% acad. yr., 100% summer)
-----, Secretary (50% time) 10,440 10,440 10,440
------- ------- -------
Salary subtotals 205,853 231,053 231,053
Allowance for salary increases (6%/yr) 0 13,863 28,558
------- ------- -------
Salary totals 205,853 244,916 259,611
Staff benefits (24.1% in FY '85, 50,640 61,719 65,682
24.7% in FY '86, 25.3% in FY '87)
Consultants 5,000 5,000 5,000
Travel 15,000 15,300 16,300
Other direct costs 22,600 26,900 28,600
Computer costs 36,000 48,000 48,000
------- ------- -------
Subtotal 335,093 401,835 423,193
Capital equipment 615,160 10,000 10,000
(2 Sequent Balance 8000 systems in
year 1, peripherals in years 2 and 3)
Lucid subcontract 518,000 408,300 234,600
U.C. Berkeley subcontract 192,308 228,300 237,893
Indirect costs (69% of direct costs, 265,714 311,776 326,503
excluding all capital equipment and
subcontract amounts over $25,000)
------- ------- -------
Total by year 1,926,273 1,360,201 1,232,189
------- ------- -------
Project cumulative total 1,926,273 3,286,474 4,518,663
! Lucid
Project Cost Estimate
($000's)
Year 1 Year 2 Year 3 Total
Direct Labor (Sch. A) 109.2 113.4 62.3 284.9
Salary Related Expense @19.8% 21.6 22.5 12.3 56.4
------------------------------------
Salary Expense 130.8 135.9 74.6 341.3
Overhead @148% 193.6 201.1 110.4 505.1
Other Direct Project Costs
(Sch. B) 126.0 18.0 19.0 163.0
------------------------------------
450.4 355.0 204.0 1009.4
Fee @15% 67.6 53.3 30.6 151.5
------------------------------------
Total Project Cost 518.0 408.3 234.6 1160.9
Notes:
1. Project cost assumes 1 Sequent machine provided to Lucid at no additional
cost located at Lucid facilities for duration of project.
2. Salary Related Expense and overhead are provisional rates based on FY86
(year end June 30) business plan projections.
3. Direct Labor rates escalated at 10% per year.
Schedule A
Direct Labor
($000's)
Year 1 Year 2 Year 3
Principal Investigator
man-months 3 2 1
rate per month 6.0 6.6 7.3
total dollars 18.0 13.2 7.3
Senior Scientist
man-months 12 12 12
rate per month 5.0 5.5 6.1
total dollars 60.0 66.0 36.1
Scientist
man-months 6 6 3
rate per month 4.2 4.6 5.1
total dollars 25.2 27.6 15.3
Technician
man-months 2 2 1
rate per month 3.0 3.3 3.6
total dollars 6.0 6.6 3.6
Total Man-Months 23 22 10
Total Dollars 109.2 113.4 62.3
Schedule B
Other Direct Project Costs
($000's)
Year 1 Year 2 Year 3 Total
Computer Equipment & Supplies
Symbolics 3670 108
Supplies @ 3K/yr 3 3 3 9
Stanford Communication 2 1 1 4
Travel & Subsistence
Air
2 trips to Washington, D.C. @1.5 ea.
1 trip to National Conference @1.5
4 trips to East Coast, technical workshop @1.5 ea.
Local travel @.5/yr 11 12 13 36
escalate @10%/yr
Printing and Reproduction @2K/yr 2 2 2 6
------------------------------------
Total 126 18 19 163
! U.C. Berkeley Budget
Three years beginning 1 June 1985.
Budget for year 1 2 3
beginning 6-1-85 6-1-86 6-1-87
Personnel
Prof. Richard Fateman (1 month, Summer) 6,000 6,000 6,000
-----, Computer Programmer (50%) 18,000 18,000 18,000
-----, Student Research Assistant 15,000 15,000 15,000
(50% acad. yr., 100% summer)
-----, Student Research Assistant 15,000 15,000 15,000
(50% acad. yr., 100% summer)
-----, Student Research Assistant 15,000 15,000
(50% acad. yr., 100% summer)
-----, Admin. Assist. (25% time) 3,600 3,600 3,600
-----, Clerk-typist (25% time) 3,600 3,600 3,600
------ ------ ------
Salary subtotals 61,200 76,200 76,200
Allowance for salary increases (6%/yr) 0 13,863 28,558
------ ------ ------
Salary totals 61,200 80,772 85,618
Staff benefits (24% ?) 14,688 19,385 20,548
Travel 4,000 4,000 4,000
Other direct costs 4,600 5,000 5,200
Computer costs 43,000 43,500 44,000
Capital equipment 10,000 10,000 10,000
(memory & disk upgrades for workstations)
Indirect costs (43% of direct costs, 54,820 65,643 68,527
excluding all capital equipment)
------ ------ ------
Total by year 192,308 228,300 237,893
------ ------ ------
Project cumulative total 192,308 420,608 658,501
∂08-Feb-85 0846 FISHER@SU-SCORE.ARPA re: Russell Baker on Word Processing (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Feb 85 08:46:24 PST
Date: Fri 8 Feb 85 08:49:35-PST
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: re: Russell Baker on Word Processing (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 7 Feb 85 19:06:00-PST
but wasn't that fun.....
-------
∂08-Feb-85 0917 TULEY@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Feb 85 09:16:58 PST
Date: Fri 8 Feb 85 09:19:06-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message
To: Jmc@SU-AI.ARPA
Hello,
Bonnie Knabe, of Lawrence Livermore Lab - Security, would like you to call
her regarding your "Q Clearance". Ph 422-7469.
thanks, Kim
-------
∂08-Feb-85 1120 RA
Boni Knabe from the Security Department at Lawrence Livermore Lab called. It's
important that she talks to you 422 7469
∂08-Feb-85 1251 RA
Cuthbert Hurd called. Please call him 494 3612.
∂08-Feb-85 1330 LAUBE@SU-SCORE.ARPA Re: project
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Feb 85 13:30:23 PST
Date: Fri 8 Feb 85 13:21:06-PST
From: Marq T Laube <LAUBE@SU-SCORE.ARPA>
Subject: Re: project
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 8 Feb 85 11:42:00-PST
Thank you, I will get in touch with Ms. Talcott.
-Mark Laube
P.S. I enjoyed your stream of cnsciousness message to the bboard.
-------
∂08-Feb-85 1437 ROISTACHER@SU-SCORE.ARPA Techpsych
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Feb 85 14:37:40 PST
Date: Fri 8 Feb 85 14:12:56-PST
From: Richard Roistacher <ROISTACHER@SU-SCORE.ARPA>
Subject: Techpsych
To: jmc@SU-AI.ARPA
I read with interest your bboard item of 20 Jan. I have perhaps been doing
TechPsych while speaking prose.
I am a MSCS student in my second term of a one-course-at-a-time
honors co-op program. In previous incarnations, I graduated in social
psychology from the university of Michigan, and was a soft-money assistant
professor in sociology and the Center for Advanced Computation at Illinois
between 1971 and 1978. I left academia with some grants and a desire to
get into the real world. The real world turned out to be first a social
research house in Washington, DC, where I did a lot of work on computer
mediated communications systems, (mostly on-line conferencing systems) and
data sharing among distributed users and organizations. I was up to my
ears in disseminating new technology to bureaucrats, a harrowing business.
After four years, and a mid-life crisis, I left washington for
Silicon Valley. Since 1982, I have been designing office automation systems
at Fortune systems, and integrated productivity products at a start-up
that is now in the process of collapsing. At present, I consult, go to
school about three quarter time, and work on a business plan.
I am back in school because, after twenty years as a computernik
of sorts, I wish to get a better intellectual grasp of the discipline. It
is also great fun to be back in the academic high-rent district.
The (now-apparent) purpose of all this text is to say hello. I have
spent the fall term as a ghost on campus, struggling through the programming
problems of CS108A, a job in a start-up company, and buying a house. You
have been mentioned to me many times as someone to know, and your bboard
item triggered my emergence as a social being in the CSD.
I would be pleased to get together on some early occasion. We may
have a common interest or two.
Regards,
RCR.
-------
∂08-Feb-85 1503 RA
A highschool senior by the name of Rich Feinberg called wanted to have your
recommendation for a good LISP text. Let me know. I promised him to call him
back.
∂08-Feb-85 1524 BSCOTT@SU-SCORE.ARPA Meeting to discuss McCarthy contract reimbursement
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Feb 85 15:24:10 PST
Date: Fri 8 Feb 85 15:21:36-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Meeting to discuss McCarthy contract reimbursement
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, TOB@SU-AI.ARPA, DCL@SU-AI.ARPA,
Wiederhold@SUMEX-AIM.ARPA
cc: BScott@SU-SCORE.ARPA
Both Tom and Gio have indicated that a short meeting is necessary in order
to understand how the reimbursement to the McCarthy contract will be handled.
How about 2:00 p.m. on Monday, February 11, Chairman's conference room?
Please confirm or make a suggestion for another time. It is extremely im-
portant to discuss this matter as soon as possible.
Betty
-------
∂08-Feb-85 1559 CLT ce soir
will you make a reservation somewhere?
∂08-Feb-85 2128 LES Lucid prose
The draft text of the Lucid proposal is in QLAMB.TEX[PAP,RPG].
∂09-Feb-85 1016 CLT Our proposal
To: "@JAPAN.DIS[1,CLT]"@SU-AI.ARPA
for collaboration with Sato and group has been granted.
Its for two years beginning April 1 1985 and extending
to September 1987 (includes a 6 month fudge).
The six of us are each allotted one trip to Japan each year.
Sato mentioned that it would be easier for them if
we were to go in two groups of three rather all at once.
There are five of them and he plans for them to come here in two groups.
Sato needs to have some idea as to when people would
come, to prepare a report.
Lets start by everyone sending me a message saying when
in the next year they would like to go to Japan.
Also, if there are any times that it would be particularly
inconvenient for having the Japanese group here,
it would be good to know.
ps
The six of us are (electronically): jmc,sf@csli,rww,cg,jk,clt
∂09-Feb-85 1716 TREITEL@SUMEX-AIM.ARPA re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 Feb 85 17:16:26 PST
Date: Sat 9 Feb 85 17:18:22-PST
From: Richard Treitel <TREITEL@SUMEX-AIM.ARPA>
Subject: re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: OTHER-SU-BBOARDS@SU-AI.ARPA, treitel@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 8 Feb 85 18:41:00-PST
Well, I hate to introduce such mundane considerations, but isn't it possible
that correct earthquake preparedness could prevent a few $meg worth of damage
to property, and so succeed in justifying itself at the margin? For example,
if we can reduce the expected incidence of fire and flooding following a quake,
that's potentially very helpful. There is also the minor matter of how much
money we would be prepared to expend to minimise the plain discomfort of living
in a quake-riven county.
- Richard
-------
∂10-Feb-85 0901 JMC*
monadic prover and vts
∂10-Feb-85 1139 TYSON@SRI-AI.ARPA re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 10 Feb 85 11:39:43 PST
Date: Sun 10 Feb 85 11:40:28-PST
From: Mabry Tyson <Tyson@SRI-AI.ARPA>
Subject: re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 8 Feb 85 18:41:00-PST
Assuming your figure of $2.5 million/life is correct, it does not necessarily
mean that EVERY $2.5 million can save a life. Perhaps we have gone past the
easy ways to save a life and it now costs $5M for each additional life
saved.
Now, if just the right people (those going to have an auto accident with a
child in their car) would go out and buy (AND USE) child safety seats, then
we can save some lives at $50 a shot! That would push the cost down. But
maybe we have to spend $2.499950M worth of advertising for each one of those
right people. Of course maybe only one out of every 50K people with children
will have a auto accident in which a child dies. That works out to be
$2.5M/life but you can bet we spent the money to buy car seats!
-------
∂10-Feb-85 1558 NILSSON@SU-SCORE.ARPA cs224
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Feb 85 15:58:10 PST
Date: Sun 10 Feb 85 16:01:22-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: cs224
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
How about Thurs May 2 from 11- 12:15 for cs224 talk about
"Commonsense Knowledge and Reasoning in Logic"? -Nils
-------
∂10-Feb-85 2339 HST gwai85
business class is ok.the gwai is from 23.of sept to 27.sept.of coyurse,you
must not stay all the time.which other places you want to visit?should i
prepare something for you?
∂11-Feb-85 0900 JMC*
reservations for Texas trip
∂11-Feb-85 0900 JMC*
Bukovsky
∂11-Feb-85 0951 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Feb 85 09:49:45 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 11 Feb 85 09:47:39-PST
Date: Mon 11 Feb 85 09:29:27-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting reminder
To: f4@SU-CSLI.ARPA, jeffrey@SU-CSLI.ARPA
Don't forget today's meeting.
---------------
Return-Path: <@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA>
Received: from SU-SCORE.ARPA by SRI-AI.ARPA with TCP; Tue 29 Jan 85 17:12:09-PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Tue 29 Jan 85 16:43:01-PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 29 Jan 85 16:41:40-PST
Date: Tue 29 Jan 85 16:43:25-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
The next F4 meeting will be Monday, Feb. 11 at 1:15 PM in the Ventura
conference room. At that time I will give what I think are the
arguments for a representationalist approach to designing AI systems
and to theories of mind.
--Bob Moore
-------
-------
∂11-Feb-85 1028 RA FORUM activities
Carolyn Tajnai would like to know which FORUM activities you intend to
participate in this week. There is a buffet supper on Tues, lunch on
Wed., banquet on Wed. night, and lunch on Thursday. You can let me know
or call her @ 7-3550.
∂11-Feb-85 1318 RA billing MCC
You did not bill MCC yet. On Jan. 10, 1985 you send me a message saying you'd
do it yourself. I have your tickets and receipts.
∂11-Feb-85 1400 RA lunch bukowsky
Vladimir Bukowsky called re lunch tomorrow (Tues. 2/12). Please call him
back @ 326 9694
∂11-Feb-85 1546 CLT laube
i assume we can afford to give him a sail account for his project?
∂11-Feb-85 1615 ullman@diablo
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 11 Feb 85 16:14:21 PST
Date: Mon, 11 Feb 85 16:15:58 pst
From: Jeff Ullman <ullman@diablo>
To: jmc@sail
I'm finally beginning to move on the "white paper" to establish
a parallel computing center.
Would you like to be the first to write a paragraph?
∂11-Feb-85 1643 RA Les Earnest
Les called. Needs feedback on proposal. Please call him (408) 986 9400.
Rationalize Berkeley.
prop[pub,les]
rpg part in pap,rpg
make sure everything is covered
system guy, Carolyn, 2 grad students
forgot research associate mentioned by Carolyn
The draft text of the Lucid proposal is in QLAMB.TEX[PAP,RPG].
∂11-Feb-85 1732 PEREIRA@SRI-AI.ARPA Re: industrial lectureship
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 11 Feb 85 17:31:59 PST
Date: Mon 11 Feb 85 17:32:34-PST
From: PEREIRA@SRI-AI.ARPA
Subject: Re: industrial lectureship
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 9 Feb 85 17:54:00-PST
Thank you for the offer, I would indeed be interested. When would you
need a summary of the proposed course?
-------
∂12-Feb-85 0606 JJW LaBrea
∂12-Feb-85 0455 JMC (on TTY20) finger
To: BUG-finger
finger@stanford gets stuck on LaBrea. It neither gives an
answer nor times out.
JJW - I've taken it out of the list.
∂12-Feb-85 1014 VAL normal form for monadic formulas
I am sorry to say that it is already known. It was discovered by H. Behmann
(Math. Annalen 86 (1922), 163-229) and is reproduced in "Introduction to
Math. Logic" by Church, Exercise 39.6.
(There are some minor differences, but it's easy to see that your
formulation is equivalent to the one given by Church).
--Vladimir
∂12-Feb-85 1307 ME
To: JMC
CC: JJW
Finger
∂12-Feb-85 0455 JMC (on TTY20) finger
To: BUG-finger
finger@stanford gets stuck on LaBrea. It neither gives an
answer nor times out.
ME - Seems that LaBrea is accepting all connections and then doing nothing.
FINGER should have in IMP input timeout (probably an especially short one
when doing Finger@Stanford).
∂12-Feb-85 1344 RA your work in AI
Mary Jennings who is a graduate student at Univer. of Texas in Austin,
would like to talk to you re computer assisted instruction. Her tel.:
(55) 392 8600 ext. 7837.
∂12-Feb-85 1426 RA Oliver Selfridge
Oliver Selfridge returned your call. Please call him 375 2906.
∂12-Feb-85 1432 RA AI faculty meeting
Reminding you about the AI faculty meeting @ 2:30 today.
∂12-Feb-85 1454 GLB
It is not true that []p⊃p is a theorem in the logic of formal provability
for otherwise interpret p by "0=1"and obtain the unprovability of the falsity
(i.e. the consistency of arithmetic). The original formulation of Lob theorem
was "if []p⊃p is provable then p is provable". The usual formalizations of this logic
use necessitation. By Proof Theory one proves (using cut-elimination)
"if []p is provable then p is provable".
∂12-Feb-85 1506 VAL seminar on circumscription
I'd like to start on Wednesday, Feb. 27, 2-3pm. Two questions:
1. Would you be willing to give the first talk? If yes, please give me
the title.
2. Can you suggest names of the people who may be interested?
- Vladimir
∂12-Feb-85 1516 RESTIVO@SU-SCORE.ARPA Chess and EKL
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Feb 85 15:16:48 PST
Date: Tue 12 Feb 85 15:17:09-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: Chess and EKL
To: JMC@SU-AI.ARPA
[cwr] Am learning how to use EKL. Would like to use EKL for proving
certain aspects of chess play. After my initialization I want
to work on some of the tougher situations I have encountered.
yom has mentioned that you have interest in chess and EKL. Would
you share your problems of interest in chess with me?
-------
∂12-Feb-85 1546 RA buffet
Buffet tonight @ 6:00 at the Faculty Club
∂12-Feb-85 1552 AI.WOODY@MCC.ARPA re: Your Visit
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 12 Feb 85 15:52:33 PST
Date: Tue 12 Feb 85 17:55:10-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: re: Your Visit
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA, ai.nora@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 11 Feb 85 21:33:00-CST
John, Thanks, we look forward to seeing you. Woody
You will have reservations at the Brookhollow.
-------
∂12-Feb-85 1621 RESTIVO@SU-SCORE.ARPA re: Chess and EKL
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Feb 85 16:21:44 PST
Date: Tue 12 Feb 85 16:24:52-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: re: Chess and EKL
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 12 Feb 85 15:19:00-PST
[cwr] Great. Transportation is cutoff until Thursday. Met with Professor
Manna on 7.2. I answered his questions but do not have an accurate
model of his beliefs that were a result of the meeting. Current
admission roadblocks involve GAO not releasing my case to committee
for lack of BS/A degree. ETS has lost GRE and CS subject test results.
Will take them to the end of the month to recover and re-send.
Professor Manna felt this might be too late.
Program in Heuristic and Symbolic search seems like a good invention.
-------
∂12-Feb-85 1623 BSCOTT@SU-SCORE.ARPA McCarthy Contract
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Feb 85 16:23:06 PST
Date: Tue 12 Feb 85 16:25:47-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: McCarthy Contract
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, TOB@SU-AI.ARPA, DCL@SU-AI.ARPA,
Wiederhold@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
I have not been able to talk with all of you about the overdraft in this
contract and how it gets cleared, but here is further detail concerning
the overdraft:
Budgeted Spent Overdraft
McCarthy (2-FCZ762) 559,351 921,352 <362,001>
Manna (2-FCZ761) l25,364 135,405 < 10,041>
Binford (2-FCZ760) 909,857 978,677 < 68,820>
Luckham (2-DPN406) 913,606 1,108,889 <195,283>
Wiederhold (2-FCZ763) 696,672 829,458 <132,786>
Unless I hear from you to the contrary by Friday, February 15, I will start
to make direct McCarthy expense charges to your new contract (N00039-84-C-
0211). A very careful accounting of the charges will be kept, and you will
all be informed on a regular monthly basis. None of the charges will be for
capital equipment or for travel.
Special note to David: it will be extremely helpful to me to have signature
authority on your account, or you might prefer to set up a suballocation
account on which I can approve expense charges. You will, of course, re-
ceive copies of all charges processed. And I will work with Jack LaBrie
on your account.
Betty
-------
∂12-Feb-85 1657 LIBRARY@SU-SCORE.ARPA Journal of Automated Reasoning
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Feb 85 16:57:37 PST
Date: Tue 12 Feb 85 17:00:47-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Journal of Automated Reasoning
To: jmc@SU-AI.ARPA
It is on order. Will announce when received. Harry
-------
∂12-Feb-85 1743 CLT burge
recursive programming was not in the math library
if you find it at home would you set it out for me?
thanks
∂12-Feb-85 1954 BARWISE@SU-CSLI.ARPA An ad hoc talk about SASL
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 12 Feb 85 19:54:08 PST
Date: Tue 12 Feb 85 19:50:02-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: An ad hoc talk about SASL
To: Cinterest@SU-CSLI.ARPA, Finterest@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA, wimmers.ibm-sj@CSNET-RELAY.ARPA, dikran@SU-CSLI.ARPA
In honor of my former student, Matt Kauffman, who will be here only
one day, I am breaking my sacred rule and scheduling an ad hoc talk in
the morning, since the afternoon is completely full. Jon
THEOREM-PROVING FOR A HIGHER-ORDER FUNCTIONAL LANGUAGE
Dr. Matt Kaufmann, Burroughs Corp., Austin Research Center
Ventura Conference Room, Friday, Feb 22, 11:00 - 12:00
Abstract: I will begin by giving a brief introduction to ARC SASL, the
higher-order functional (applicative) language of Burroughs Austin
Research Center. This will be followed by a very brief overview of a
semantics and formal logic for SASL, and then by a few proofs about
SASL programs. Finally, I will discuss some research on mechanically
aided theorem-proving for SASL.
-------
∂13-Feb-85 0034 cheriton@Pescadero Facilities committee meeting
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 00:33:57 PST
Date: Wed, 13 Feb 85 00:37:05 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Facilities committee meeting
To: csdfacilities@Pescadero
I would like to propose that we meet before the faculty lunch discussion
on computer facilities, currently scheduled for March 5th.
Tom Binford also suggests having a meeting.
Proposed time: 2:45-4:00 on Thurs. Feb. 21st
Agenda:
1. Progress with SUN workstations.
2. New dept. DEC-20?
3. A plan for dept. computer facilities!?
Any other agenda items? Please let me know if you can or cant make this
meeting time. Ideally, I would like to develop some specific suggestions
on what directions the dept. shoudl take in terms of equipment.
Comments?
∂13-Feb-85 0043 JDLH@SU-SCORE.ARPA Re: Facilities committee meeting
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 00:43:17 PST
Received: from SU-SCORE.ARPA by Pescadero with TCP; Wed, 13 Feb 85 00:46:26 pst
Mail-From: JDLH created at 13-Feb-85 00:45:24
Date: Wed 13 Feb 85 00:45:24-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: Re: Facilities committee meeting
To: cheriton@SU-PESCADERO.ARPA
Cc: JDLH@SU-SCORE.ARPA
In-Reply-To: Message from "David Cheriton <cheriton@Pescadero>" of Wed 13 Feb 85 00:37:36-PST
Resent-Date: Wed 13 Feb 85 00:46:07-PST
Resent-From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Resent-To: csdfacilities@SU-PESCADERO.ARPA
I can make that time, but I would prefer to start 30 minutes later, i.e.
from 3:15-4:30 Thurs 21. Feb.
--Jim DeLaHunt JDLH @ Score 497-0644 (415) 327-JDLH
-------
∂13-Feb-85 0112 JMC@SU-AI.ARPA In defense of dinosaurs, i.e. time-sharing
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 01:08:43 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Wed, 13 Feb 85 01:11:48 pst
Date: 13 Feb 85 0104 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: In defense of dinosaurs, i.e. time-sharing
To: su-bboards@SU-AI.ARPA, csdfacilities@SU-PESCADERO.ARPA
Computing facilities:
1. Compared to 10 years ago, CSD has adequate facilities in some
absolute sense. Anyone wanting to prepare a report, a file or
even a book can do it at a rate limited by himself rather than
by computing facilities. Anyone wanting to run a Fortraan, Pascal
or Lisp program can do so provided his requirements for memory
and crunching are moderate. Only a few CSD people are limited
in their accomplishment by computer facilities.
I know of no recent squabbles where some people claim others are
hogging the resources. This is in sharp contrast with ten years
ago.
2. There are still some shortages.
a. What some people want to do imposes immoderate
requirements on speed, memory size or graphics.
b. Disk space is still expensive enough so that some
people delete report files when they leave --- even though
we now have library areas for them.
c. Not everyone who wants one has a home terminal.
d. The facilities for working with extended character
sets are poor.
e. The present workstations lack certain important
programs, e.g. Lisp and Tex.
d. Not everyone has even a terminal on his desk.
e. Many have no desk who should. For many this
limitation is more important than compute limitations.
3. The babble over dinosaurs not withstanding, many who have
the financial resources to do otherwise continue to do most
of their computing on the time-shared machines. There are
a variety of reasons in my case.
a. Inertia. For most of what I do, writing, there is
no obvious advantage.
b. I have compatible facilities at home and in my office.
c. Neither terminal is bulky, contains a fan, or emits
significant heat.
d. Lisp and a variety of document compilers are available.
e. I, personally, don't have to worry about maintenance.
f. My tens of megabytes of personal files are backed up.
At least I haven't lost any since 1969.
g. Whenever I have made inquiries about getting facilities
with a larger screen, one or more of the preceding lacks has
persuaded me to wait a while longer.
Most of the senior faculty is not inclined to change at
present even though we could get the resources.
4. Perhaps I would benefit greatly by changing. Who at Stanford
has the very best facilities at home and in the office? What are
they? Can I get them just for money, i.e. without doing maintenance
myself either of hardware or of files? This question is addressed
to the faculty dinosaur baiters, e.g. Vaughan Pratt and Brian Reid.
5. Assuming SCORE is crowded, we should accept the additional 20
offered by DARPA.
∂13-Feb-85 0235 GROSOF@SU-SCORE.ARPA Re: In defense of dinosaurs, i.e. time-sharing
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 02:35:40 PST
Date: Wed 13 Feb 85 02:32:52-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: Re: In defense of dinosaurs, i.e. time-sharing
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 13 Feb 85 01:04:00-PST
Hi John,
Well said!
Benjamin
-------
∂13-Feb-85 0641 HI.RICH@MCC.ARPA Re: fantasy in HCN
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 06:41:02 PST
Date: Wed 13 Feb 85 08:40:48-CST
From: Elaine Rich <HI.RICH@MCC.ARPA>
Subject: Re: fantasy in HCN
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 13 Feb 85 00:44:00-CST
I got it yesterday and will send it out this morning. I'll be around while
you're here so let me know when you're free.
Elaine
-------
∂13-Feb-85 1002 RA REASON subscription
I talked to Lynn Scarlett. The renewal notices go out automatically. Their
computer cannot tell a gift subscription from a paying one. You should ignore
the renewal notices.
∂13-Feb-85 1008 tasar@Camelot test
Received: from CAMELOT by SU-AI.ARPA with TCP; 13 Feb 85 10:08:15 PST
Date: Wed, 13 Feb 85 10:07:24 pst
From: Omur Tasar <tasar@Camelot>
Subject: test
To: jmc@su-ai
Let's see if this arrives.
∂13-Feb-85 1057 RA David Chudnovsky
Please call David @ (212) 864 5320.
∂13-Feb-85 1149 RESTIVO@SU-SCORE.ARPA re: Chess and EKL
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 11:48:56 PST
Date: Wed 13 Feb 85 11:23:58-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: re: Chess and EKL
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 12 Feb 85 15:19:00-PST
[cwr] Is 14.2 before CS226 a good time to see you?
-------
I don't understand 14.2, but just before CS226 is never a good time
to talk to me.
∂13-Feb-85 1222 CLT msg
Please call Mr. Sokoloff of Hambrecht(?) and Quist re Encore
617-574-0500 (Boston). Says he is likely to be in after 5pm their time
∂13-Feb-85 1315 JJW Qlambda question
To: RPG, JMC
How are ordinary (non-process) closures interpreted in Qlambda? For
instance, in
(LET ((F (LAMBDA (X) (+ 3 X))))
(QLET T ((Y (F 1))
(Z (F 2)))
(CRUNCH Y Z)))
we presumably compute (F 1) and (F 2) in parallel. Are there then
two environments for the closure bound to F, one in which X is 1 and
the other in which X is 2?
One usually thinks of LAMBDA as creating a single environment, and
the Scheme data-abstraction examples make use of this. I don't see
how to reconcile the desire to have one copy of some data (such as
local variables in a closure that holds state), with the need to have
separate copies for uses like the above.
∂13-Feb-85 1333 RA Austin tickets
Your tickets are on your desk.
∂13-Feb-85 1340 RA academy lunch
Muriel Bell called 321 2052 re your speaking at an academy lunch.
∂13-Feb-85 1601 AAAI-OFFICE@SUMEX-AIM.ARPA Cooperation Draft
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 16:00:49 PST
Date: Wed 13 Feb 85 15:42:40-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Cooperation Draft
To: Tenenbaum@SRI-KL.ARPA, Brachman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA,
AI.woody@MCC.ARPA, JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Here is the second draft of the cooperation policy for your review.
I would appreciate hearing your comments.
Thanks,
Claudia
AAAI POLICY FOR COOPERATION WITH OTHER ORGANIZATIONS ON TECHNICAL MEETINGS
In general, the AAAI will only consider cooperating on meetings that
do not conflict with the its goals and objectives. As scientific
society, the AAAI encourages cooperation with other groups on narrowly defined
technical topics set in small workshop settings. As a product of
these cooperative meetings, the AAAI requests that the outstanding
papers be presented at the Annual AI Research Conference or at the
National Conference on Artificial Intelligence.
The following terms need to be met prior to any approval for
cooperation is issued.
1. "NATIONAL" "CONFERENCES"
AAAI will not endorse a meeting in any AI topic area called "National"
or a "Conference". The AAAI Conference Committee strongly prefers to
endorse Workshops, or perhaps "Symposia." If a national conference is
proposed whose major area of concern is not AI, but is related (e.g.
the AMA sponsors its major conference with a section on Computers in
Medicine (including AI)), the Committee will certainly consider
cooperating with that organization. However, national conferences
that temporally overlap AAAI conferences and its sponsored activities
will not be considered.
a. If AAAI has already endorsed a workshop in a certain topic area,
then it will not endorse another one that significantly overlaps that
topic and occurs close in time to the previously endorsed meeting.
Overlapping topics and the degree of temporal conflict will be
determined by the AAAI Conference Committee.
b. AAAI will not endorse any meeting that occurs close in time to one
of its National Conferences [closeness in time must be determined],
unless that meeting is coordinated with the one of the AAAI Program
Chairs so to enhance one of the AAAI Conferences.
2. FOCUS
The topical focus of any approved meeting must be narrow and well defined.
3. REVIEW STANDARDS
The reviewing standards for papers must be clear and acceptable to the
Conference Committee. We must know exactly the composition of the
program committee, the method of paper review, final responsibility on
the decision to accept or reject, and the criteria used in making the
decision. The goal is only to support meetings that subscribe to the
same general policy as AAAI regarding acceptance of only the highest
quality papers, within a fair and equitable review framework.
a. At least a majority of the Program Committee and/or paper
reviewers must represent the broader interests of the AI community and
does not represent any particular special-interest group. The AAAI
Conference Committee requests that the composition of the Program
Committee and/or the paper reviewers be presented to them as a part of
the application (see below for more details about the application).
b. If a workshop is to be by invitation only, the sponsors
responsible in extending the invitations are requested to present to
the AAAI Conference Committee the names of the invitees and their
method of selection of those individuals.
In the both cases noted above, the AAAI wants to insure that the broad
interests of the AI community are represented in its sponsored events.
4. TUTORIALS
If the meeting intends to offer Tutorials on AI Topics to
participants, then AAAI must find the speakers acceptable, using the
same criteria as above with respect to maintaining high quality and
fair representation to the broader AI community. Because the tutorial
revenues are such a large contributor to the financial health of the
AAAI, the AAAI needs to evaluate the financial impact of its
association with other organizations that sponsor AI-related topical
tutorials. In order to maintain our principal revenue source, the AAAI
requests that 20% of the gross revenue from that meeting's tutorials
be paid to the AAAI.
5. INCOME FROM THE MEETING
The AAAI requests information on who would financially benefit from
this meeting and the means of collection and distribution of monies from
the meeting.
The AAAI requests that its members receive the same discount for
registration fees and the purchase of that meeting's proceedings as
the sponsoring society's (e.g. IEEE) members.
6. DOCUMENTATION
All documentation offered to participants at the meeting should be
sent, free of charge, to at least the chairman of the AAAI Conference
Committee. In particular, we need to receive any conference programs
and proceedings as soon as possible.
7. OUTSTANDING PAPERS
The chair of the workshop must agree to recommend to AAAI any papers
presented at the meeting that are considered seminal and of interest to
the national AI audience. These papers will be considered for
re-presentation at one of the AAAI Conferences.
APPLICATION FOR COOPERATION
The requestor is asked to send a letter which includes the following
information to the Executive Director of the AAAI.
1. Statement of the goals and objectives of the meeting:
2. Identification of the topic;
3. Proposed date and location of the meeting;
4. Identification of the meeting's sponsors and proposed
Program Committee members and/or paper reviewers; method of
paper review; the parties responsible for the final decisions
on the papers;
5. Information of Tutorial Topics, if appropriate; stated
agreement to pay the AAAI the 20% of the gross tutorial
revenues;
6. Information about the method of collection and distribution
of monies and the organization who would benefit from the
meeting; and
7. A blanket agreement to comply with the other demands noted
above.
The Executive Director will circulate the request to the AAAI Conference
Committee, the President and the Workshop Chair.
Approvals for cooperation will come from the AAAI Conference Committee,
the AAAI President, and/or Executive Director. Approval will be sent to
the requestor in a formal letter signed by either the Chair of the
Conference Committee, the President or the Executive Director.
The approval letter will indemnify the AAAI from any financial or
other responsibilities, losses or damages.
-------
∂13-Feb-85 1802 NILSSON@SU-SCORE.ARPA Re: reference
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 18:01:50 PST
Date: Wed 13 Feb 85 17:43:30-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: reference
To: JMC@SU-AI.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 13 Feb 85 14:31:00-PST
There are a number of SRI reports that could be referenced, but these
are probably hard to get copies of (I have some). Otherwise, there is
an SRI Technical Note: "Progress on a Computer Based Consultant,"
Peter E. Hart, AI Group Tech Note 99, SRI, January 1975. [I have
a dim memory that something like that technote appeared in IJCAI,
but maybe not.] -Nils
-------
∂13-Feb-85 1950 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Special Seminar in Logic and Foundations
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 19:50:33 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 13 Feb 85 19:49:23-PST
Date: 13 Feb 85 1942 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Special Seminar in Logic and Foundations
To: su-bboards@SU-AI.ARPA, "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Erwin Engeler, E.T.H., Zurich
Title: Logic programming and combinatory algebras
Time: Tuesday, Feb. 19, 2:30-4:00
Place: Room 380-X, Math Corner Stanford
S. Feferman
∂14-Feb-85 0835 RA movie
The video company called; they got the movie you wanted. 327 9400
∂14-Feb-85 0932 RA CS Search Committe
Can you make it on Monday, Feb. 25 @ 3:00 for the committee meeting? If
not, let me know when you can make it.
The paper you asked for is on your desk. I made you an extra copy for good
measure.
∂14-Feb-85 1017 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting summary
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 Feb 85 10:17:11 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 14 Feb 85 10:16:17-PST
Date: Thu 14 Feb 85 10:15:00-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting summary
To: f4@SU-CSLI.ARPA, jeffrey@SU-CSLI.ARPA
Since our illustrious area coordinator has suggested that we try to
have some of our discussions in written form for the benefit of
posterity, I offer the following summary of my presentation in the F4
meeting earlier this week (which will appear in the newsletter, in any
case) to get the ball rolling.
At the meeting of project F4 on Feb. 11, Bob Moore presented arguments
for the representational approach to designing AI systems and
modelling mental activities in humans. Moore first noted the relative
ease with which a human can acquire individual beliefs without
disturbing very much of the rest of his mental state. This supports
the idea that distinct beliefs ought to be embodied more-or-less
individually, since acquiring a new belief does not seem to require
wholesale reorganization of one's mental state. Moore went on to
argue that the combinatorial structure of what can be believed
suggests a similar combinatorial structure to how it is believed. The
idea is that the combinatorial structure of the sentences used to
characterize belief states does not serve merely to distinguish one
belief state from another; there are regularities in behavior that
depend on that structure. For instance, having a belief of the form
"if not P, then Q" is associated with behavior appropriate to Q's
being true when evidence of P's being false is presented, but not
necessarily with behavior appropriate to P's being true when evidence
of Q's being false is presented, even though "if not P, then Q" and
"if not Q, then P" are equivalent under most interpretations of
the conditional. The fact that this and many other structural
distinctions in sentences used to classify belief states correspond to
systematic distinctions is behavior presents a prima facie case that
the belief states themselves are similarly structured. But, Moore
argued, under a conception of representation sufficiently abstract to
cover the kinds of "representation" actually used in computational
models of mental states, the claim that mental states involve
"syntactic" representations--a language of thought--probably comes to
no more than this. Moore concluded by noting that none these
arguments bear on the question of whether the language of thought is
distinct from natural language, but that empirical considerations, such
as the indexicality of natural language and the difficulty of stating
principles of reasoning that apply directly to natural language,
suggest that the two are distinct.
-------
∂14-Feb-85 1055 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 Feb 85 10:55:48 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 14 Feb 85 10:54:47-PST
Date: Thu 14 Feb 85 10:51:36-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA, jeffrey@SU-CSLI.ARPA
At the end of Monday's meeting, we were somewhat unsettled as to what
to do next. One suggestion was that we continue with the topic of
representationalism, if we could think of something to read that would
focus the discussion. Another suggestion was that we ask Dick Jeffrey
to talk about his work, which would tie into the previous discussion
with the issue of what probabilities have to do with what goes on in
the head. We tentatively settled on the second, in part for lack of
any ideas of what to read to do the first.
Since the meeting, I have remembered a paper that would be nearly
ideal for implementing the first idea. It is Dan Dennett's review of
Fodor's "Language of Thought," which appears in Dennett's book
"Brainstorms" under the title "A Cure for the Common Code." This
review critiques Fordor's arguments for a language of thought from a
standpoint that I think would be very congenial to the situation
semantics and situated automata folks.
How would people (especially Dick) feel about reading Dennett's paper
for next time and postponing Dick's presentation until the following
meeting. I would be happy doing either, so let me know what you
prefer.
--Bob
-------
∂14-Feb-85 1101 FFL
To: JMC@SU-AI.ARPA, shortliffe@SUMEX-AIM.ARPA, stan@SRI-AI.ARPA,
RPG@SU-AI.ARPA, wiederhold@SU-SCORE.ARPA, FFL@SU-AI.ARPA
Here is a tentative schedule for cs224. Please let me (FFL@SAIL) know
if there are any changes you wish to make in your title, name,
affiliation, net address, title of talk, etc. More information
about the location of the seminar will be forthcoming.
CS 224 ARTIFICIAL INTELLIGENCE SEMINAR
THURSDAYS 11:00 am -- 12:15 pm
Nils Nilsson, Organizer
DATE SPEAKER and SUBJECT
April 4 Dr. Alex Pentland, Schlumberger Research (Pentland@sri-ai)
Title to be announced
April 11 Prof. Terry Winograd, Stanford CSD and Linguistics (TW@sail)
Computers and Natural Language: Prospects and Problems
April 18 Dr. Barbara Grosz, SRI and CSLI (Grosz@sri-ai)
The Problem of Discourse
April 25 Dr. Richard Fikes, Intellicorp (Fikes@usc-ecl)
Frame-Based Representations
May 2 Prof. John McCarthy, Stanford CSD (JMC@sail)
Commonsense Knowledge and Reasoning in Logic
May 9 Prof. E. H. Shortliffe, Stanford Med. School (Shortliffe@sumex)
Oncocin
May 16 Dr. Stan Rosenschein, SRI (Stan@sri-ai)
Mobile Robot Research at SRI
May 23 Dr. Richard Gabriel, Stanford and Lucid (RPG@sail)
Qlambda
May 30 To be announced
June 6 Prof. Gio Wiederhold, Stanford CSD and Med. School
Knowledge Representatin in Rx (Wiederhold@score)
-------
∂14-Feb-85 1139 SELLS@SU-CSLI.ARPA Chomsky book
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 Feb 85 11:39:30 PST
Date: Thu 14 Feb 85 11:41:06-PST
From: Peter Sells <Sells@SU-CSLI.ARPA>
Subject: Chomsky book
To: jmc@SU-AI.ARPA
Your Chomsky book can be picked up from Susi at the front desk at CSLI.
The cost is $10, and should be in the form of a check payable to Stanford
University.
Peter
-------
∂14-Feb-85 1149 NILSSON@SU-SCORE.ARPA $400K
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Feb 85 11:49:32 PST
Date: Thu 14 Feb 85 11:52:11-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: $400K
To: jmc@SU-AI.ARPA
cc: eaf@SUMEX-AIM.ARPA
Folks, Since the original purpose of the $400 K in the equipment
contract was, I believe, to upgrade CSD computing facilities
generally [rather than to provide computation for a specific
research project], it seems to me that we ought to try to use
those funds for that broader purpose in so far as possible. That would
mean avoiding any premature compromises with DARPA to use that
$400 K for the Qlambda Sequent. Let's try to present to ARPA a
strong case for the Qlambda Sequent being paid for by new funds and
using the older funds for their original purpose [perhaps buying another
Sequent for more general use]. I certainly wouldn't want that
principle to stand in the way of getting ARPA support for the
Qlambda project--let's just not give in easily. Comments? -Nils
-------
∂14-Feb-85 1238 AI.WOODY@MCC.ARPA Re: result already known
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 14 Feb 85 12:38:06 PST
Date: Thu 14 Feb 85 14:40:04-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Re: result already known
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 12 Feb 85 13:03:00-CST
Yes, I would believe Lifshcitz. Agree that a lot of problems fall
in this category. See you tomorrow. Woody
-------
∂14-Feb-85 1326 JJW Closures
To: RPG, JMC
I think I found the answer to my question about closures. I was confusing
the frame and the environment of a specific invocation of a closure.
I.e., for both ordinary and process closures, a new frame containing the
local variables is created each time the closure is applied, and any
"state" information is gotten by using non-local variables which refer to
the frame of the lexically enclosing environment.
So the difference between ordinary and process closures is only that no
two instances of a process closure can be running at the same time.
I'd like to make a claim: in the form
(QLAMBDA pred (var ... var) . body)
there is no useful reason to evaluate PRED at runtime. That is, I can't
think of any program in which you'd want something to be an ordinary
closure some of the time, and a process closure at other times. The
PRED parameter in the QLAMBDA form has such a different meaning from
the PRED in the QLET form, where it decides whether to use parallelism;
here it decides between semantically different options.
If you believe this, then the programmer will always use a constant for
PRED. Hence, there is no need for (QLAMBDA NIL ...) since it is the same
as LAMBDA, and the only possibilities are (QLAMBDA T ...) and (QLAMBDA
'EAGER ...). I've been trying to show that there is no real use for the
EAGER form of QLAMBDA, but I haven't got that yet. If so, then there
would be no need for the PRED at all, which would simplify the form even
more.
∂15-Feb-85 1133 JJW Qlambda
One thing I'd like to clear up in the definition of Qlambda is the meaning
of a "process". The June paper talks about "processes" and "process closures"
but never defines the former. It also uses the two terms interchangeably at
points, though it is fairly clear that they are different.
I've asked RPG about this, though he hasn't yet had time to reply. I'd like
to initiate a more rigorous definition of the language as a basis for doing
the implementation. I don't even know if anyone has dealt with a denotational
semantic definition of a multiprocessing language, though I suspect someone
has. Any leads would be appreciated.
∂15-Feb-85 1501 CHRIS@SU-CSLI.ARPA Hintikka lunch
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 15 Feb 85 15:01:00 PST
Date: Fri 15 Feb 85 14:59:17-PST
From: Chris Menzel <CHRIS@SU-CSLI.ARPA>
Subject: Hintikka lunch
To: finterest@SU-CSLI.ARPA
I've been asked to organize a lunch with Hintikka for those whose interests
intersect with his work in logic sometime between his arrival on March 11 and
his departure on March 18. Would anyone with a strong interest in attending
please get back to me? I'll then do my best to squeeze yet another event into
everyone's already overloaded schedules.
Chris
P.S. Food will be provided.
-------
∂15-Feb-85 2134 SG I will be out of office.
To: JMC@SU-AI.ARPA, CLT@SU-AI.ARPA, RA@SU-AI.ARPA, RWW@SU-AI.ARPA,
ST@SU-AI.ARPA, nardi@SRI-AI.ARPA
CC: SG@SU-AI.ARPA
I will be out of town from Feb.20 (Wed) to Mar.2 (Sat). I will visit
Pittsburgh, NY, Boston, Cambridge, Lexington, Norwalk, and Columbus.
It is a business trip for my home institute, NTT*.
415-856-4790 (home)
415-940-1414 NTT California office, Los Altos.
Mr.Suzuki, Director
Mr.Akabane, Vice-Director
* NTT = Nippon (Japan) Telegraph and Telephone.
∂16-Feb-85 0730 ATP.BLEDSOE@UTEXAS-20.ARPA [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 16 Feb 85 07:29:58 PST
Date: Sat 16 Feb 85 09:32:02-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
To: jmc@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
1) 14-Feb Larry Fagan Request for Support for AI in Medicine Worksh
2) 16-Feb To: FAGAN@SUMEX-AIM. Re: Request for Support for AI in Medicine Wo
Message 1 -- ************************
Return-Path: <FAGAN@SUMEX-AIM.ARPA>
Received: from SUMEX-AIM.ARPA by UTEXAS-20.ARPA with TCP; Thu 14 Feb 85 09:25:36-CST
Date: Thu 14 Feb 85 07:24:17-PST
From: Larry Fagan <FAGAN@SUMEX-AIM.ARPA>
Subject: Request for Support for AI in Medicine Workshop
To: Bledsoe@UTEXAS-20.ARPA
cc: Kingsland@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA
Dear Woody,
I'm writing to you on behalf of the organizing committee for the 1985
Workshop on Artificial Intelligence in Medicine (an annual event that has
been occuring since the mid-1970's). This year's workshop will be held at the
National Library of Medicine in Bethesda, MD. on July 10-12. As in the past,
the workshop will be designed to communicate recent results in medical
applications among the researchers in the area, including their senior
graduate students.
Last year, the AAAI kindly provided a $5,000 grant to allow more
graduate students to attend the meeting than would otherwise have been
possible. We are hopeful that a similar AAAI grant will be possible this
year, possibly at a higher funding level ($7500 or $8000). If additional
funds were available, then a few more students would be able to present
their work and learn about the activities of others in the discipline. I
found the AIM Workshops to be particularly valuable learning experiences
when I was involved with my own doctoral dissertation, and I would like to
see current AIM students have similar opportunities to meet (and present
their work to) the leaders in the field. Over the years, the AIM
community has provided the direction for much of the research in expert
systems. Assistance from AAAI will help provide important support this
active area of AI research.
Thank you for considering this request. Please let me know if I
can provide further information to you or the members of the AAAI Council.
Regards,
Larry Fagan
-------
Message 2 -- ************************
Mail-From: ATP.BLEDSOE created at 16-Feb-85 09:31:13
Date: Sat 16 Feb 85 09:31:13-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: Request for Support for AI in Medicine Workshop
To: FAGAN@SUMEX-AIM.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "Larry Fagan <FAGAN@SUMEX-AIM.ARPA>" of Thu 14 Feb 85 09:25:44-CST
Larrry,
Good to hear from you.
I am passing your message on to John McCarthy who is the chairman
of the committee for AAAI funding of workshops. I'm sure he will
handle this properly.
Please let me know how things are going. I hope to see you in
Los Angeles in August.
Woody
-------
-------
∂17-Feb-85 2007 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Feb 85 20:07:33 PST
Date: Sun 17 Feb 85 20:10:47-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
[cwr] am looking for "how to pay the weatherman" paper. who, when, and
where was this written?
-------
∂17-Feb-85 2337 HST gwai85
hi john.i propose for you the first day - that is the 24th (the 23th
is more preparation).please tell me how much moeney i have to plan for
you.herbert
∂18-Feb-85 0732 AI.WOODY@MCC.ARPA Your visit
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 18 Feb 85 07:32:30 PST
Date: Mon 18 Feb 85 09:34:08-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Your visit
To: jmc@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
John,
Today (Monday) I am feeling a good bit better but am still very
hoarse. In all my life I have never had this much loss of voice. It
is not only the lack of communication but the pain of it.
I am disappointed that I was not able to join with you more
while you were here. I do hope that you will come again soon -- as we
discussed. Please suggest some dates. I'm glad that Bob Boyer was
able to see you a couple of times.
Woody
-------
∂18-Feb-85 1000 JMC*
Write Resnick about money.
∂18-Feb-85 1006 Bobrow.pa@Xerox.ARPA Re: industry lectureship
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 18 Feb 85 10:06:07 PST
Received: from Tokay.ms by ArpaGateway.ms ; 18 FEB 85 10:07:36 PST
Date: 18 Feb 85 10:07 PST
From: Bobrow.pa@XEROX.ARPA
Subject: Re: industry lectureship
In-reply-to: John McCarthy <JMC@SU-AI.ARPA>'s message of 11 Feb 85 17:49
PST
To: JMC@SU-AI.ARPA
cc: bobrow.pa@XEROX.ARPA
John,
A number of us are considering some sort of joint course. Are there
Dandelions available for us to use if we wanted to make a project
course?
danny
∂18-Feb-85 1149 WASOW@SU-CSLI.ARPA clarification about summer RAships
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Feb 85 11:48:44 PST
Date: Mon 18 Feb 85 11:47:46-PST
From: Tom Wasow <WASOW@SU-CSLI.ARPA>
Subject: clarification about summer RAships
To: principals@SU-CSLI.ARPA
The announcement I just sent to Friends about summer RAships says that they
will "generally" be half-time, for two months. Other arrangements can be
worked out, when there is a good reason to do so. In particular, if any of
you have projects planned that will require full-time RAs this summer, your
letter of support for the applicants should indicate this fact and explain
why more than the default amount of support is needed.
Questions should directed to me, preferably by means of electronic mail.
Tom
-------
∂18-Feb-85 2226 CLT qproposal
To: LES@SU-AI.ARPA, JMC@SU-AI.ARPA, CLT@SU-AI.ARPA
I have added some paragraphs to PROP[PUB,LES] filling in some gaps.
(don't for get the Lucid part is QLAMB.TEX[PAP,RPG])
One thing I forgot to ask today - should we add more names of
people (graduate student level) - to the text, or to the budget?
For example JJW, RTC, IAM?
∂19-Feb-85 0838 JOHN@SU-CSLI.ARPA Re: use of dandelions for a course
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 19 Feb 85 08:37:56 PST
Date: Mon 18 Feb 85 21:36:31-PST
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: Re: use of dandelions for a course
To: JMC@SU-AI.ARPA
cc: JOHN@SU-CSLI.ARPA, eric@SU-CSLI.ARPA, betsy@SU-CSLI.ARPA, clay@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 18 Feb 85 11:03:00-PST
I am sure that it can be worked out. It would be good if whatever moneys
CS can access for use of computers in the classroom could be used to
reimburse CSLI. But unless the numbers are large, I think you should go
ahead and we can work out the details later. Perhaps Eric, Clay or
Betsy will give you a call about this.
-------
∂19-Feb-85 1310 RA LA trip
You have reservation for tomorrow, Feb. 20, SJ to LA 8:30am flight no. 164.
On the way back PSA 465, 4:00pm.
∂19-Feb-85 1311 RA AI and genetics
A Tim Murphy would like to know the name of someone who does AI and genetics.
Do you know of someone? Please let me know, he is going to call me back tomorrow.
Thanks.
∂19-Feb-85 1330 RA Susan McCarthy
Please call Susan at home.
∂19-Feb-85 1500 JMC*
waltuch appointment
∂19-Feb-85 1503 DAVIES@SUMEX-AIM.ARPA HPP Architecture Project Meeting
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Feb 85 15:03:46 PST
Date: Tue, 19 Feb 1985 15:01 PST
Message-ID: <DAVIES.12089022120.BABYL@Sumex>
From: DAVIES@Sumex
To: CLT@SAIL, JJW@SAIL, JMC@SAIL
Subject: HPP Architecture Project Meeting
cc: Davies@Sumex
The main topic for this week is last week's visit to MIT by Byron
Davies and Bruce Delagi. Between us, we investigated the
Multiprocessor Emulation Facility, Multilisp, and Actors.
Come tomorrow at 8:45 am for a view of what's happening in parallel
computing at MIT.
-- Byron
∂19-Feb-85 1504 RA Circumscription seminar
Vladimir told me that you wanted notices to be sent
to SRI, IBM, Xerox, HP, and Fairchild AI. To whom, and how do I go about
doing that?
∂19-Feb-85 1543 DEK prereq for 258
This year's catalog says that your course on MTC to be given next
year has 156 as a prerequisite.
But 156 no longer exists, so you may find it easy to teach
that course (having no students qualified to attend)!
I plan to change the prerequisite to 157A, although that is
pretty elementary; let me or Kathy Berg know if you have a
better idea?
∂19-Feb-85 1600 JMC*
feraud.1[let,jmc]
∂19-Feb-85 1633 RA Livermore
What did you do in Livermore a week ago?
∂19-Feb-85 1756 EJS
I seem to need to show people that I have performed responsibly in working
job situations.
Could you draft a short note of recomendation for me.
Maybe you could mention that I have an active and inventive mind
(as you have told me)
Maybe you could mention that I took on an important and difficult project
as a service to the department and finished it.
It would make a great difference to me if you could do this.
Thankyou
Ted Selker
-------
∂19-Feb-85 2001 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Feb 85 20:01:43 PST
Date: Tue 19 Feb 85 19:59:38-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
[cwr] Would appreciate your suggesting some EKL proofs to look at.
Where is the file for the Mr. S. + P. proof kept that you
were working with today in class?
Thank you.
-------
∂19-Feb-85 2029 FEIGENBAUM@SUMEX-AIM.ARPA [<AJM@LL.ARPA>: Proposed Visit to Discuss LL Staffer for HPP Project]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Feb 85 20:29:35 PST
Date: Tue 19 Feb 85 20:30:32-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [<AJM@LL.ARPA>: Proposed Visit to Discuss LL Staffer for HPP Project]
To: nii@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA,
rpg@SU-AI.ARPA, jmc@SU-AI.ARPA, rindfleisch@SUMEX-AIM.ARPA
See the enclosed message from Al McLaughlin of Lincoln. I invited him
to send someone from his division to our project for two years to help
and to learn. He responded with this apparently well-suited candidate.
In the message, Al suggests some dates to come out here. I can't make it
on March 6-7, but the other dates are Ok with me. How about others?
I would prefer to have him out when most of us are around. RSVP.......Ed
---------------
Return-Path: <AJM@LL.ARPA>
Received: from LL.ARPA by SUMEX-AIM.ARPA with TCP; Tue 19 Feb 85 12:11:52-PST
Date: Tue 19 Feb 1985 15:11:11 EST
From: <AJM@LL.ARPA>
Subject: Proposed Visit to Discuss LL Staffer for HPP Project
To: Feigenbaum at SUMEX-AIM
Cc: AJM at LL
Message-ID: <AJM.05054670@LL.ARPA>
ED,
I MET WITH THE LINCOLN DIRECTOR'S AND AM DELIGHTED TO REPORT THAT I
HAVE BEEN GIVEN APPROVAL TO PROCEED WITH OUR PROPOSAL TO HAVE A
LINCOLN STAFF MEMBER SPEND TWO YEARS WORKING ON YOUR HPP PROJECT.
I WOULD LIKE TO ARRANGE A VISIT TO MEET WITH YOU TO INTRODUCE JOHN DELANEY,
WHO I HOPE YOU WILL FIND TO BE AN EXCELLENT LL CANDIDATE FOR YOUR
HPP PROJECT.
EDUCATION
STANFORD UNIVERSITY
DEGREES
B.S.E.E. (WITH DISTINCTION)-JUNE 1970
M.S.E.E.-JUNE 1970
PH.D.E.E. (MINOR IN COMPUTER SCIENCE)-JANUARY 1975
AREAS OF CONCENTRATION
MATHEMATICAL SYSTEMS THEORY (DISSERTATION AREA)
COMPUTER HARDWARE AND SOFTWARE
COGNITION AND ARTIFICIAL INTELLIGENCE
ARTIFICIAL INTELLIGENCE COURSES
COMPUTING WITH SYMBOLIC EXPRESSIONS, AUTUMN 1970 (A)
COGNITIVE PROCESSES AND SIMULATION, AUTUMN 1970 (+)
ARTIFICIAL INTELLIGENCE PROJECT, WINTER 1970 (A)
COMMENTS
THE AI PROJECT COURSE INVOLVED APPRENTICE-LEVEL WORK ON A
NATURAL LANGUAGE INFORMATION ENTRY AND QUERY SYSTEM USING
SEMANTIC NETWORKS FOR ITS KNOWLEDGE BASE. THAT WORK WAS
EFFECTIVELY DIRECTED BY W. FAUGHT, A STUDENT OF DR. K. COLBY.
I DID ADDITIONAL COURSE WORK COGNITIVE PSYCHOLOGY.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
ARTIFICIAL INTELLIGENCE COURSES
KNOWLEDGE BASED APPLICATION SYSTEM, FALL 1977 (A)
NATURAL LANGUAGE AND THE REPRESENTATION OF KNOWLEDGE,
SPRING 1979, (A)
WORK EXPERIENCE
M.I.T. LINCOLN LABORATORY
AUGUST 1982 TO PRESENT
AUGUST 1974 TO SEPTEMBER 1980
JUNE 1972 TO SEPTEMBER 1973
MAIN AREAS OF WORK
ICBM BOOSTER TANK FRAGMENT DISCRIMINATION
LOW ALTITUDE RADAR COVERAGE PREDICTION
DISTRIBUTED AEROACOUSTIC TRACKING
MULTIPROCESSOR ARCHITECTURE STUDIES
ALPHATECH, INC.
OCTOBER 1980 TO JULY 1982
MAIN AREAS OF WORK
DYNAMIC SYSTEM MODELING AND ANALYSIS
MILITARY COMMAND AND CONTROL MODELING AND ANALYSIS
MULTITARGET TRACKING
RESTORATION PLANNING FOR POWER GRIDS
----------------------------------------
I PROPOSE SEVERAL DATES FOR A VISIT TO MEET WITH YOU AND JOHN AT STANFORD
MARCH 6TH OR 7TH
MARCH 11TH OR 12TH
MARCH 21ST OR 22ND
APRIL 8TH THRU 11TH
LOOKING FORWARD TO MEETING WITH YOU,
AL MCLAUGHLIN
-------
∂19-Feb-85 2126 EJS
To whom it may concern is fine, I would rather only bother you once.
Ted
∂19-Feb-85 2256 cheriton@Pescadero CSD Facilities meeting
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 19 Feb 85 22:56:11 PST
Date: Tue, 19 Feb 85 22:59:10 pst
From: David Cheriton <cheriton@Pescadero>
Subject: CSD Facilities meeting
To: csdfacilities@Pescadero
I understand that Jim, Joe, Len, Jeff, Tom and I can all make it
for Thurs. at 2:45 pm (Jim by 3:00). Havent heard from JMC??
So, I propose we meet and discuss, resolve, flail about, etc.
I have to confirm room, but will try for Chairman's conference
room. Will let you know if not. So, see you there at 2:45 pm
Thurs. Feb 21st barring holocaust or further messages.
∂20-Feb-85 0753 NILSSON@SU-SCORE.ARPA Friday
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Feb 85 07:53:13 PST
Date: Wed 20 Feb 85 07:55:52-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Friday
To: jmc@SU-AI.ARPA
When I invited you to dinner this Fri., I don't think I mentioned
the time. It's 7 pm (Fri. Feb. 22).
Here is how to get to the Nilssons:
South (Hillward)
/\ L |
a |
|
M | ←
| e |←←←←←←←←←←←←←←← |←| Nilsson
| s | Coquito Way 150 Coquito Way
A | a | 854-5265
l | ←←←←←←
p | /
i | /
n | |
e |-----------|
| La Mesa Drive (highly schematic)
R |
o | (Ladera Shopping Center)
a |
d |-------------
| La Cuesta Drive
|
|
|
|
|
S.J. <=========================== I-280 S.F. =>
|
|
Menlo Park
Take Alpine Road hillward (toward Portola Valley), cross underneath
I-280, look for Ladera Shopping Center on right, continue on Alpine
until Chevron Station at La Mesa Drive. Turn right on La Mesa,
follow its twists and turns (it tries to lose you at one point by
pulling an abrupt left turn) for about a mile until you come to
Coquito Way. Turn right on Coquito Way; we are at end of street.
-------
∂20-Feb-85 0806 BARWISE@SU-CSLI.ARPA Acknowledgements
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 20 Feb 85 08:06:27 PST
Date: Wed 20 Feb 85 08:04:08-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Acknowledgements
To: Researchers@SU-CSLI.ARPA
Stanley Peters gave a very encouraging briefing to the Advisory Panel
yesterday about NSF funding possibilities in language and information,
and the chance for funding for interdisciplinary centers, in
particular.
Listening to Stanley, an obvious but new thought occurred to me. To
make the case for center funding, one thing we need to convince NSF of
is that certain kinds of things can happen in an integrated setting
like this that does not happen so easily elsewhere. I think we all
need to be careful to make this fact clear in our work.
A personal example: One idea that I have picked up and used is the
idea of language as action and hence utterances as things that change
state, pronoun assignments in particular. I exploited this idea in
some notes on anaphora. Whether it is a good idea or not, is not the
point. What is true is that I would not have gotten the idea except
for the interaction with folks here. The idea of language as action
and action as things that change state seem to be common wisdom among
our AI contingent, but they were new to me. When I publish these
notes, I will try to make this debt clear. It is not your usual sort
of acknowledgement, though, since I cannot identify any single person
for explaining this piece of common wisdom to me. It just gradually
sank in, which is what you would hope for at a place like this.
I think many of you have had similar experiences. For the future of
this sort of interaction here and elsewhere, we need to be accurate
and generous in our acknowledgements of such debts, in print and in
public presentations.
As I said, this is an obvious point, but one whose special importance
for the future of our field had escaped me.
Jon
-------
∂20-Feb-85 0833 NII@SUMEX-AIM.ARPA Re: [<AJM@LL.ARPA>: Proposed Visit to Discuss LL Staffer for HPP Project]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Feb 85 08:33:17 PST
Date: Wed 20 Feb 85 08:34:50-PST
From: Penny Nii <NII@SUMEX-AIM.ARPA>
Subject: Re: [<AJM@LL.ARPA>: Proposed Visit to Discuss LL Staffer for HPP Project]
To: FEIGENBAUM@SUMEX-AIM.ARPA
cc: brown@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA, rpg@SU-AI.ARPA, jmc@SU-AI.ARPA,
rindfleisch@SUMEX-AIM.ARPA, NII@SUMEX-AIM.ARPA
In-Reply-To: Message from "Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>" of Tue 19 Feb 85 20:30:44-PST
Any time in March. That week in april is n.g. for me...penny
-------
∂20-Feb-85 0934 CLT Kronos
Fri Mar 1 is next concert
∂20-Feb-85 1043 RA ENCORE
John Sokoloff (415) 576 3617 called. He is with Hambrecht & Quift. re ENCORE.
∂20-Feb-85 1135 ullman@diablo Parallelism White Paper
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 20 Feb 85 11:34:57 PST
Date: Wed, 20 Feb 85 11:35:33 pst
From: Jeff Ullman <ullman@diablo>
Subject: Parallelism White Paper
To: cheriton@pescadero, feigenbaum@sumex, golub@score, jlh@shasta, jmc@sail,
linton@sierra, mayr@diablo, owicki@sierra, papa@score, tob@sail
I have a draft of a white paper that mentions each of you as potential
users of a center for parallel computing; in most cases it was based
on a paragraph or more that you sent me, but in almost all cases
what you sent has been transmogrified in various ways.
I would be happy to have you each revise your sections,
prefereably keeping within the size, tone, and level that I
tried to use across the board.
I would also appreciate comments on the prefatory material on pp. 1-3.
Hard copy is in the ID mail.
---Jeff
∂20-Feb-85 1354 RA Barbacue of Louis
Propsed meeting next Tuesday (2/26) or Thursday (2/28). Will call tomorrow.
∂20-Feb-85 1408 RA MAD
Please call John Nafeh (56) 943 1711.
∂20-Feb-85 1529 TULEY@SU-SCORE.ARPA msg's
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Feb 85 15:29:13 PST
Date: Wed 20 Feb 85 15:30:03-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg's
To: jmc@SU-AI.ARPA
Hello - I have a couple for you:
Betsy, of CSLI, called with this message: "use of some dandelions for a
course your working out with your Xerox colleagues in association with
Dan Bobrow." Ph: 7-1224
Susan Ritter would like you to call her. Ph: 415-964-6874.
that's it for now,
-Kim
-------
∂20-Feb-85 1743 PEREIRA@SRI-AI.ARPA Proposed course
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Feb 85 17:42:49 PST
Date: Wed 20 Feb 85 17:44:28-PST
From: PEREIRA@SRI-AI.ARPA
Subject: Proposed course
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
Here is the summary of the course I propose to give next year.
I have presented much of this material before in an intensive 20-hour
course, but I think that 30 hours would allow a less hurried pace.
I would very much appreciate any suggestions with respect to
content or form.
-- Fernando
Prolog and Natural Language Analysis
Introduction the logic programming language Prolog as a tool for
natural language analysis and related topics in Artificial
Intelligence. Prolog concepts and programming techniques will be
introduced through a progression of natural language analysis
examples. No previous experience with logic programming or natural
language analysis is required. The following topics will be
discussed: representing context-free grammars in Prolog; definite
clause grammars; the logical variable; difference lists; top-down
parsing and the Prolog execution model; syntactic analysis of complex
constructions; semantic translation rules and logical form; general
computations in grammars; structure manipulation and multistage
analysis; operations on logical forms; deductive question-answering in
Prolog; metalevel computation and the embedding grammar formalisms in
Prolog; extralogical operations; implementation of alternative parsing
algorithms; the organization of a natural-language question-answering
system. Examples will be available as running Prolog programs and
will be used for exercises. Prerequisites: elementary notions of
logic, formal language theory and symbolic computation.
-------
∂21-Feb-85 0052 LES Draft proposal
To: Kahn@USC-ISI.ARPA
CC: JMC@SU-AI.ARPA, CLT@SU-AI.ARPA, RPG@SU-AI.ARPA
My next message will be the text of a draft proposal for the Qlambda project
and the one after that will be a set of budgets. If you have any questions,
please contact whichever one of us seems appropriate.
∂21-Feb-85 0819 BUCHANAN@SUMEX-AIM.ARPA Industrial Professorship
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 08:19:14 PST
Date: Thu 21 Feb 85 08:20:47-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Industrial Professorship
To: jmc@SU-AI.ARPA
cc: waleson@SUMEX-AIM.ARPA
John,
Reid Smith was here for the Computer Forum and expressed some interest
in the Ind.Professorship for some quarter in the near future. Do you
have information you could send him [--> RGSMITH @ RUTGERS] or would you
like to send somex over to me to mail to him?
He'd like to know when there are openings, what the terms are, any
restrictions on what he could teach, and any other information that would
let him know whether to make a formal application.
thanks,
bgb
-------
∂21-Feb-85 0901 NILSSON@SU-SCORE.ARPA Re: Proposed course
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 09:01:37 PST
Date: Thu 21 Feb 85 09:02:41-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: Proposed course
To: PEREIRA@SRI-AI.ARPA
cc: jmc@SU-AI.ARPA, NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "PEREIRA@SRI-AI.ARPA" of Wed 20 Feb 85 17:44:55-PST
Looks great to me! -Nils
-------
∂21-Feb-85 0929 DAVIES@SU-SIERRA.ARPA Parallel Computing Survey -- First Round
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 09:29:29 PST
Date: Thu, 21 Feb 1985 09:27 PST
Message-ID: <DAVIES.12089485539.BABYL@SU-SIERRA.ARPA>
Sender: DAVIES@SU-SIERRA.ARPA
From: DAVIES@SU-SIERRA.ARPA
To: Cheriton%Pescadero Golub@SCORE, Lantz@Pescadero, Mayr@SCORE,
JMC@SAIL, Pratt@Navajo, Ullman@SCORE, Wiederhold@SUMEX,
PMBANKS@Sierra, M@Sierra, gill@SU-ISL, linton@Amadeus,
Lundstrom@Sierra, SSO.OWICK@Sierra, Reid@Glacier, FAT@Sierra,
Feigenbaum@sumex, Brown@sumex, Delagi@sumex, RPG@sail,
Nii@sumex, Aiello@sumex, Saraiya@sumex, SHahn@sumex, Yan@sumex,
Rindfleisch@sumex, Davies@sumex, Schoen@sumex, Nishimura@sumex,
Worley@SCORE, DCH@SCORE, Anderson@SCORE, SSO.OWICKI@Sierra,
nowicki@Pescadero, BXJ@SAIL, sailesh@ISL, trickey@diablo,
Helmbold@SCORE, Mayr@SCORE, gluck@SU-PSYCH, Lundstrom@Sierra,
Wiederhold@SCORE, Celoni@SCORE, Lynch@Sierra, Mak@Sierra,
Chiu@Sierra, Boesch@Sierra, Freeman@SCORE
Subject: Parallel Computing Survey -- First Round
cc: Davies@SU-SIERRA.ARPA
The data from the first round of the Last Whole Stanford Parallel
Computing Survey may be found below.
Thanks to everyone for their cooperation.
-- Byron
!
The Last Whole Stanford Parallel Computing Survey
--> First Round <--
This is first set of data for the Last Whole Stanford Parallel
Computing Survey. Information came chiefly from individual
respondents and the CIS research directory. It reflects a great deal
of diversity, and I have made only a cursory attempt to organize it.
Please send any additions or corrections to Davies@Sierra. In
particular, if you know of someone involved with parallel computing at
Stanford who is not on the list, please let me know.
-- Byron (Davies@Sierra)
CS Faculty (chief source: CIS research directory)
Prof. David Cheriton (Cheriton@Pescadero): partitionable computer
systems, high performance interprocess communication
Prof. Gene Golub (Golub@SCORE): study of numerical algorithms for
parallel architectures
Prof. Keith Lantz (Lantz@Pescadero): partitionable computer systems
Prof. Ernst Mayr (Mayr@SCORE): parallel algorithms, complexity theory,
architectures
Prof. John McCarthy (JMC@SAIL): multiprocessing Lisp
Prof. Vaughn Pratt (Pratt@Navajo): programming languages for parallel
computing
Prof. Jeff Ullman (Ullman@SCORE): theory of parallel computation
Prof. Gio Wiederhold (Wiederhold@SUMEX): distributed databases, with
arbitrary coupling of processors.
EE Faculty
Prof. Peter Banks (PMBANKS@Sierra): distributed graphics systems
Prof. James Clark: parallel VLSI systems and architectures for CAD
Prof. Mike Flynn (M@Sierra): emulation tools for concurrent systems
Prof. John Gill III (gill@SU-ISL): parallel architectures for circuit
simulation
Prof. J. Hennessy (jlh@Shasta): multiprocessor architectures employing
MIPS processor
Prof. Mark Linton (linton@Amadeus): distributed databases
Prof. David Luckham (DCL@SAIL): reliable multiprocessing systems,
concurrent programming in Ada
Steve Lundstrom (Lundstrom@Sierra): highly concurrent, very high
performance system architectures with high level support for
applications; performance analysis and projection of such systems.
Prof. Susan Owicki (SSO.OWICK@Sierra): concurrent programming: proofs
of correctness, and performance measurement and analysis
Prof. Brian Reid (Reid@Glacier): distributed systems
Prof. Fouad Tobagi (FAT@Sierra): high-performance networks
Heuristic Programming Project
Ed Feigenbaum (Feigenbaum@sumex): expert systems on multiprocessor
architectures
Harold Brown (Brown@sumex): expert systems on multiprocessor
architectures
Bruce Delagi (Delagi@sumex): simulation of large-grain multiprocessors
for symbolic computing.
Dick Gabriel (RPG@sail): research on and implementation of
multiprocessing Lisp systems.
Penny Nii (Nii@sumex): parallel architectures for problem-solving
Nelleke Aiello (Aiello@sumex): parallel implementation of blackboard
problem-solving architecture.
Nakul Saraiya (Saraiya@sumex): simulation of parallel implementation
of blackboard problem-solving architecture.
Sam Hahn (SHahn@sumex): parallel implementation of blackboard
problem-solving architecture.
Jerry Yan (Yan@sumex): parallel computing for AI.
Tom Rindfleisch (Rindfleisch@sumex): multiprocessor architectures for
expert systems
Byron Davies (Davies@sumex): abstraction and compositionality in
programming languages for symbolic multiprocessors.
Eric Schoen (Schoen@sumex): knowledge representation for parallel
problem solving
Sayuri Nishimura (Nishimura@sumex): simulation of symbolic
multiprocessors.
So Far Uncategorized
Pat Worley (Worley@SCORE, Joe Oliger, CS): inherent parallelism in
numerical solution of partial differential equations.
Daniel Chapiro (DCH@SCORE): globally-asynchronous locally-synchronous
systems: safe transfer of information and control among very high
performance multiprocessors.
Richard Anderson (Anderson@SCORE): theoretical aspects of parallel
computation; fast parallel algorithms for "rather trivial problems".
Bill Nowicki (nowicki@Pescadero): distributed systems -- how to
partition programs between workstations and server hosts; V-System.
Bengt Jonsson (BXJ@SAIL): semantics, proof systems, and synthesis of
communicating processes.
Sailesh Rao (sailesh@ISL): design of digitical signal processing
algorithms for mesh-connected processor networks.
Howard Trickey (trickey@diablo, Ullman): finding parallelism in
ordinary sequential programs, for efficient translation of high-level
language programs into silicon.
David Helmbold (Helmbold@SCORE): PRAM algorithms for scheduling
problems.
Ernst Mayr (Mayr@SCORE): parallel algorithms, complexity theory,
architectures.
Mark Gluck (gluck@SU-PSYCH): computation models of the neural bases of
learning and memory; applications to AI and engineering probelms;
parallel distributed models of cognitive abilities; learning and
adaptation of parallel processing networks in AI.
Jim Celoni (Celoni@SCORE, Center for Large-Scale Scientific
Computation): compiling single-assignment programs into dataflow
graphs for partitioning and execution on multiprocessor systems.
Bill Lynch (Lynch@Sierra, Lundstrom): characterization of applications
to estimate performance on parallel architectures
Victor Mak (Mak@Sierra, Lundstrom): concurrent systems testbed
Kharmting Chiu (Chiu@Sierra, Lundstrom): simulation of communication
networks for multiprocessors
Brian Boesch (Boesch@Sierra, Lundstrom): analysis of languages for
programming parallel systems
Andy Freeman (Freeman@SCORE, Ullman): low-cost, highly parallel
architectures for architectural simulation
∂21-Feb-85 0934 RA Austin trip December
Shall I charge MCC for consulting for your December 20 trip? If yes
is it also 2 days @ 1,000.00 a day? How about meals and taxis? How
assume they paid for your hotel.
∂21-Feb-85 1135 BETSY@SU-CSLI.ARPA Tip
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 11:35:16 PST
Date: Thu 21 Feb 85 11:33:38-PST
From: Betsy Macken <BETSY@SU-CSLI.ARPA>
Subject: Tip
To: initiators@SU-CSLI.ARPA
Here's a tip to help your initiator money go farther:
Barbara Partee came to our Advisory Panel meeting via Peoples' Express
Airline. It cost her only a third of the $900 other airlines
would have charged because she couldn't order her ticket 30 days
ahead. She couldn't say enough good things about the comfort and
service. She didn't have to come stand-by, she had plenty of room, it
left and arrived on time, etc. She says that's how she plans to
travel in the future.
P.S.
American Express claims that the other airlines are trying to drive Peoples'
Express out of business with the current price wars, so their
prices are cheaper if you can meet their restrictions. They say that
once Peoples' Express is out of business, prices will all go up.
-------
∂21-Feb-85 1149 RA Dr. King
Please call Dr. King in Dallas (214) 788 1740. You can call collect.
∂21-Feb-85 1252 RA adams.2
Is he from the school of engineering at stanford?
∂21-Feb-85 1258 cheriton@Pescadero Meeting in Chairman conference room and ..
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 12:57:21 PST
Date: Thu, 21 Feb 85 12:59:06 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Meeting in Chairman conference room and ..
To: csdfacilities@Pescadero
here is a blurb I wrote on facilities, just in case you have
a chance to read before hand.
CSD COMPUTER FACILITIES:
THE GIANT LEAP FORWARD
David R. Cheriton
21 February 1985
This is a proposed framework for discussion with a few ideas of directions,
problems and solutions. This is a beginning to a working document, I hope.
Why do we need computer facilities?
Uses include:
- Document preparation
- Electronic mail
- Information storage, retieval and manipulation e.g. 1022 and
SUNCalc.
- Instructional programming.
- Computer-based simulation and experimentation.
- Recreation
There seems to be three classes of uses:
Fixed function word processing, electronic mail and suncalc stuff. Users do
not write programs, typically. The key issue is to provide a
stable adequate service for users. This has nothing to do
with us being a computer science dept. other than us possibly
expecting more than the proletariat.
Crunching Computers are used for large computations. Programming is
done to get the computation done. Normally, the programming
facilities required are simple, e.g. Pascal, C and
garden-variety Lisp. Examples include chip simulations and
VLSI design checking and software compilations. The key issue
is getting the most cycles for least cost. Again, this
function is not special to a computer science dept. In fact,
we may well do less than others.
Experimental/instructional programming
Programming for the sake of better understanding how to
program, or in the large, how to build systems. Here, what
the programs finally do is less important that what is learned
along the way. Also, the "right" kind of cycles become
important. For example, true parallel processing cycles are
being important for this work. It is this work that is more
specific to a Computer Science Dept.
I propose that we provide for the diversity of computer facilities that these
different needs call for yet attempt to share facilities to the degree
possible. Moreover, a common infrastructure is necessary to avoid artificial
barriers arising between different groups in the department.
Computing Infrastructure
I propose a division of facilities into:
- communication
- storage
- processing
- user interfaces
- special peripherals.
Communication
The basis for our computing facilities is a good communication network or
internetwork. A worthy goal is for all portions of the department to be
connected by a reliable high-speed network or internetwork. Currently, we
have a random collection of 3 and 10 Mb Ethernet. The "campus network" is
being improved. Developing the communication base needs more explicit
planning and support.
Besides hardware, there is an issue of software and protocols.
Storage
There are three aspects to storage services.
- Temporary but active storage, as for paging areas for diskless
workstations.
- Medium-term file storage, as with our current file systems.
- Archival storage - for backup of medium term files and long-term
storage of "permanent" but infrequently accessed files.
Currently, there is a unnecessarily tight binding of storage facilities to
host such that only direct users of a particular host can use its storage
facilities. That is, I can only store files on Score if I learn how to use
Score as a direct user.
I propose that we invest effort in a plan and action to achieve looser
coupling between processing services and storage services. The "department
file server" is a step in the right direction. Additional file servers will
be required to provide more active file support. For instance, our 10
diskless workstations are going to need more storage support.
This also applies to archival support. We currently have a large number of
6250 tape drives in the building chewing up space, power and tape operators,
and running at low utilization. I propose we consider installing a separate
"archival network" to connect file servers to an archival facility and try to
coordinate backup facilities as a service. (This may be infeasible because of
software issues.)
In summary, a good goal for the department is to coordinate storage services
so as to minimize technical boundaries (as opposed to protection boundaries)
to sharing data and programs and to minimize duplication of facilities (like
tape backup) that are feasible to share.
Processing
The demand for "big crunch" may have grown to the point where we can justify
separate machines for providing such facilities, as opposed to economically
justify such facilities by sharing them with word-processing. However, again
software may be a key determing factor.
I perceive a signficant need in the future for parallel processing cycles for
instruction and experimentation.
User Interfaces
Conventionally, everyone has had a dumb terminal as their interactive
interface to computer systems here. There is a demand for graphics
interfaces, including displays and mice. People are also using a greater
diversity of software, peripherals and machines, and there are more available.
That, in combination with the demand for fancy user interfaces suggests moving
more intelligence into the terminal - at least to me it does. Thus, the 10
new diskless SUN workstations could be viewed as an initial move in this
direction.
Ideally, a personal workstation of this nature provides a window on the
network facilities plus a local computation resource for common interaction.
That is, sitting at a workstation, I can edit files and read mail locally. I
can access a variety of storage and computation services on the network as
well as use the workstation as a terminal to connect to other hosts.
One issue in this view is cost. SUN workstations are around $10K each. The
MacSUN also addresses some of these needs and lots more cost-effective than
the SUN workstations, but seems higher risk in being custom-built hardware.
Going to IBM PC's or Macintoches would be cheaper and closer to the "real"
cost of terminal. However, I would hope we can justify a certain level of
extravagance because we want our facilities reflecting what will be
cost-effective in the future more than what was cost-effective in the past.
Special Peripherals
The familiar example is the printer. The department has a growing and
on-going need for high-quality printers. The Dover has served well.
Moreover, the model of having it as a network service, available for a fee
from any of the connect machines is excellent. We need to retain this model
and develop a plan for improving our printers for the future.
It seems appealing to have other special peripherals available as well, like
color printers and digitizers. Perhaps some coordination with research groups
can make these facilities more generally accessible? Another special
peripheral might be an accurate time service.
Evolution of the Universe - Software
There was a time when we could be software self-sufficient but not any more.
We need to position our computer facilities strategy to take advantage to the
degree possible of software development outside of Stanford. Similarly, we
should avoid overcommitments to technology that is becoming obselete.
For instance, the department has a tremendous investment in WAITS and TOPS-20
and the related software. There is no immediate reason to attack these
facilities. However, serious questions should be raised about increasing our
investment and commitment to these systems, especially when they are being
abandoned, even by the manufacturer. Of course, Unix is not immune to this
problem either.
I propose that the ideal is to position ourselves so that we can take maximal
advantage of software and hardware developments outside of Stanford as well as
within, and that we have "planned obselescence" for all our computer systems.
How do we do this? Well, one aspect is placing an importance on software
portability. Another is developing a "lifeplan" for computer systems and
providing for transitions between the new and the old.
Research Groups vs. the Department
Research groups must individually decide and acquire or acquire access to the
equipment that they require to carry out their research. No interference by
the department in this autonomy should be tolerated, except for space reasons.
In fact, space for equipment and space for people needs to be handled with
equal care. However, we should strive for an organization and structure in
which research equipment can (to degree feasible) augment department
facilities and department facilities be used to minimize the difficulties in
engaging in research. It also seems ideal for there to be reasonable avenues
for faculty and students to instigate community-spirited projects to improve
the department facilities. That is, can we tap the expertise we have in our
department research groups to improve the department facilities. That in turn
improves the students and the operation of the department overall, which
provides benefit to the researchers.
The End - for now
∂21-Feb-85 1341 ME AP back up
∂20-Feb-85 2217 JMC
tty exist 16 doesn't seem to revive the AP.
ME - A cable came loose. It's fixed now.
∂21-Feb-85 1353 RA leave early
Any objections to my leaving early (3:00) on Thursdays for a class?
∂21-Feb-85 1430 INGRID@SU-CSLI.ARPA CSLI Summer School and ASL Meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 14:30:29 PST
Date: Thu 21 Feb 85 14:31:54-PST
From: Ingrid Deiwiks - 497-3084 <INGRID@SU-CSLI.ARPA>
Subject: CSLI Summer School and ASL Meeting
To: jmc@SU-AI.ARPA
Dear Professor McCarthy,
As you might recall, I am organizing the CSLI Summer School and ASL
Meeting for Jon Barwise. Jon is planning to have a list of all titles
sent out with the next ASL Newsletter which is going out on March 4.
This means that I have to get the list to the printers on Monday.
Could you therefore please let me have the title of your talk today
(or tomorrow at the latest), please? Also, would you send me a short
abstract as soon as possible? Thank you very much.
Sincerely,
Ingrid Deiwiks
-------
∂21-Feb-85 1446 VAL Circumscription seminar
To: "@NTC.DST[1,VAL]"@SU-AI.ARPA
First seminar on circumscription:
Speaker: John McCarthy
Topic: Unsolved Problems with Circumscription
Time: 2-3 pm, Wednesday, Feb. 27
Place: MJH 252
∂21-Feb-85 1447 INGRID@SU-CSLI.ARPA re: CSLI Summer School and ASL Meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 14:46:52 PST
Date: Thu 21 Feb 85 14:48:17-PST
From: Ingrid Deiwiks - 497-3084 <INGRID@SU-CSLI.ARPA>
Subject: re: CSLI Summer School and ASL Meeting
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 21 Feb 85 14:44:00-PST
Thanks a lot for the quick response! I'll show it to Jon.
Ingrid
-------
∂21-Feb-85 1612 NISSENBAUM@SU-CSLI.ARPA Comments
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 16:12:01 PST
Date: Thu 21 Feb 85 16:11:22-PST
From: Helen Nissenbaum <NISSENBAUM@SU-CSLI.ARPA>
Subject: Comments
To: f4@SU-CSLI.ARPA
Bob,
I know this is a bit old, but I wanted to "re-submit" the comment I made
in the last F-4 meeting. Any comments are welcome.
I understood you to be defending the following:
Claim 1:
If you give someone input of the form 'If not-P then Q', and condition
-P holds they will perform the appropriate action suggested by Q.
However, given that -Q holds they will most likely not perform the
action suggested by P, even though this is prescribed by 'not-Q
implies P' and this is equivalent to the initial input.
Conclusion: This is evidence for a representational view. You can
explain the phenomenon by saying that representations
preserve syntactic features of the input and so the two formulae are
not immediately identified as equivalents. (The individual may not
even think of the second one at all.)
Claim 2:
One of the reasons you give for thinking sentences in natural language
are not the medium of representation is that this would not allow
certain Principles of Reasoning to operate.
My point: Claims 1 and 2 are pushing in opposite directions. The
more one "formalizes" sentences in natural language to accomodate
Principles of Reasoning, the less one has to work with to
distinguish the two formulae above. In the limiting case, a system
that works with the formalism and principles of Propositional Logic
will be "blind" to the difference between 'If not-P then Q' and
'If not-Q then P' because they are equivalent. And this is what I take
"equivalence in a certain system" to mean. (Think of what we mean by
an equivalence class.)
Helen.
-------
∂21-Feb-85 1904 SMC
Please call me at Mary and Whit's ASAP that is where I am going now.
∂21-Feb-85 2136 BARWISE@SU-CSLI.ARPA Reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Feb 85 21:36:33 PST
Date: Thu 21 Feb 85 21:35:46-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Reminder
To: Cinterest@SU-CSLI.ARPA, Finterest@SU-CSLI.ARPA
Matt Kaufmann's talk about SASL, higher order languages, etc. will be
Friday at 11 a.m. in the Ventura conference room.
-------
∂21-Feb-85 2318 JJW Rest of the facilities meeting
We discussed the need for better organization of software and proposed hiring
a new person to be a moving force in this area: the job would be to identify
things needing to be done (like the file server) and their priority, motivate
people to work on them, and investigate available software from outside sources
to avoid wasted effort. (Also to avoid duplication of effort within the
department by acting as a coordinator.)
The management aspects of this job probably wouldn't be full-time, so this
person should be able to do some of the software work himself. There was some
discussion about whether this person should report to Len; the general consensus
was yes.
Tom Binford thinks we should investigate the facilities plans, if any, of
comparable institutions like CMU and MIT so that we can move in the same
direction as them whenever it would be beneficial. (And perhaps share some
software development.) People were somewhat lukewarm about this idea.
∂22-Feb-85 0922 TULEY@SU-SCORE.ARPA CS Search Committee Meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Feb 85 09:22:24 PST
Date: Fri 22 Feb 85 09:24:13-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: CS Search Committee Meeting
To: jmc@SU-AI.ARPA
cc: Ra@SU-AI.ARPA
Hello,
The CS Search Committee meeting will be in the Chairman's Conference room
here in MJH on Feb 25, 3:00-4:30.
Joanna from Prof. Cannon's office left the msg. ph:7-3601.
thanks, Kim
-------
∂22-Feb-85 0952 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA Re: next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 22 Feb 85 09:48:09 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 22 Feb 85 09:46:47-PST
Date: Fri 22 Feb 85 09:41:51-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: Re: next F4 meeting
To: f4@SU-CSLI.ARPA, jeffrey@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
In-Reply-To: Message from "Bob Moore <BMOORE@SRI-AI.ARPA>" of Thu 14 Feb 85 10:54:46-PST
The reaction to my message about what to do next in F4 was (a) very
small, and (b) evenly divided. I think, then, that we will go ahead
with the original plan and have Dick Jeffrey next time, which will be
March 4. Copies of Dick's paper, "Probability and the Art of
Judgement" will be available next Monday. I'll bring them with me to
the F1 meeting, so those of you attending F1 can pick them up there.
The rest, I will leave somewhere at Ventura and send out a message as
to where they are. (SRI people probably should get a copy from me
Monday morning, before the papers go over to Stanford.)
I don't know exactly what Dick will talk about, but I think one of the
things he plans to discuss is the question of what "psychological
reality" there is to decision theory.
--Bob Moore
-------
∂22-Feb-85 1026 SJG counterfactuals
Dear John:
In case you're interested in attending, I will be talking to the HPP
SIGlunch about counterfactuals next Friday (the 1st). It's in the
Chemistry Gazebo ...
Matt
∂22-Feb-85 1108 VARDI@SU-CSLI.ARPA Possible-Worlds Semantics for Modal Logic
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 22 Feb 85 11:07:47 PST
Date: Fri 22 Feb 85 11:05:20-PST
From: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Subject: Possible-Worlds Semantics for Modal Logic
To: bboard@SU-CSLI.ARPA
cc: f1@SU-CSLI.ARPA, f2@SU-CSLI.ARPA, f4@SU-CSLI.ARPA, vardi@SU-AIMVAX.ARPA,
pratt@SU-AIMVAX.ARPA, fagin.ibm-sj@CSNET-RELAY.ARPA,
halpern.ibm-sj@CSNET-RELAY.ARPA
I have quite thoroughly investigated the subject recently, and I'd like to
run my findings by you.
I see four essential elements in today's possible-worlds semantics:
1. Necessity is truth in all possible worlds.
2. There is a relation of possibility or alternativeness between worlds.
3. Various conditions on the posibility relation give rise to different
modal logics.
4. The notion of a possible world is a primitive one, so these worlds have
no internal structure.
Let's see now who deserves credit for these ideas.
1. As far as I can see, this is due to Carnap. The folklore credits it to
Leibniz, but some people doubt it. Leibniz definitely talked about possible
worlds and about necessary truths, but it's not clear that he actually defined
necessity as truth in all possible worlds. Interestingly, Carnap gets today
very little credit. Why?
2. The possibility relation is due to Kanger and Hintikka in 1957.
3. Kanger 1957 and Hintikka 1961.
4. Bayart 1958.
Something also was going on at Oxbridge. Apparently, Meredith had (2), (3),
and (4) in unpublished noted that were recorded by Prior in 1956. In 1962
Prior published a paper with these ideas where he credits them to Geach.
At any rate, Kripke was definitely a latecomer, but many people know of
possible-worlds semantics as 'Kripke semantics'. The reason in my opinion
is that Kripke elevated the subject from philosophy to mathemtics. He seems
to be the first one to actually supply completeness proofs. Also, his paper
was clearly written, and was not published in an obscure journal.
What is the moral? Write well, give proofs, and choose a good journal.
Any comments?
-------
∂22-Feb-85 1136 TAJNAI@SU-SCORE.ARPA SunNet
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Feb 85 11:35:53 PST
Date: Fri 22 Feb 85 11:37:35-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: SunNet
To: JMC@SU-AI.ARPA
cc: RA@SU-AI.ARPA
John, Dr. Wilkinson of GE will be visiting Stanford on Monday,
March 18. Would you be available to have lunch with him and talk to
him about SunNet.
Your views on structure of SunNet.
Your picture of how that will develop.
Carolyn
-------
∂22-Feb-85 1142 TAJNAI@SU-SCORE.ARPA re: SunNet
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Feb 85 11:41:59 PST
Date: Fri 22 Feb 85 11:43:11-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: re: SunNet
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 22 Feb 85 11:38:00-PST
CAn you give me a referral? Is Bill Yundt the right person?
or should it be someone from the academic side who might not be
biased?
C.
-------
∂22-Feb-85 1500 JMC*
ap stuff to Hook
∂22-Feb-85 1619 ullman@diablo Re: A Center for ...
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 22 Feb 85 16:19:50 PST
Date: Fri, 22 Feb 85 16:21:41 pst
From: Jeff Ullman <ullman@diablo>
Subject: Re: A Center for ...
To: JEF@Sail, JMC@Sail
Cc: CLT@Sail
you're right about the direction of the arrows.
I forget which way they were supposed to go anyway,
but they should be double ended.
I won't argue with you about the importance of such a
center. Obviously lots of good things happen when
one person grasps a part of the problem.
∂22-Feb-85 1700 RA AP president
AP president and general manager is Keith Fuller. His address:
50 Rockefeller Plaza, New York, NY 10020.
∂22-Feb-85 1802 VARDI@SU-CSLI.ARPA Internal Semantics and Kaplan's Intensional Logic
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 22 Feb 85 18:02:07 PST
Date: Fri 22 Feb 85 18:03:07-PST
From: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Subject: Internal Semantics and Kaplan's Intensional Logic
To: finterest@SU-CSLI.ARPA
cc: fagin.ibm-sj@CSNET-RELAY.ARPA, halpern.ibm-sj@CSNET-RELAY.ARPA,
yom@SU-AI.ARPA
After my talk about internal semantics for modal logic, some people
commented about its semilarity to Kaplan's semantics for intensional logic
in his Ph.D. Dissertation. Well, I've spent several hours today reading through
Kaplan's work, and as far as I can see the similiarity is completely technical.
The reason that Kaplan's construction collapses at the third level necessarily
follows from Kaplan's motivation. Indeed, a similar collapsing happen in
internal models for S5. This is an exception, however, rather than the
general case. Having two modalities in S5 (say two knowers) is sufficient to
prevent the collapsing.
Moshe
-------
∂23-Feb-85 1328 NILSSON@SU-SCORE.ARPA Alan Kay
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Feb 85 13:28:27 PST
Date: Sat 23 Feb 85 13:29:59-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Alan Kay
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
Alan Kay's home phone number is (213) 471-7339. He has a secy
there answering it during working hours. Sometimes he answers it
himself. Sometimes he has it connected to an answering machine.
I had spoken to him earlier about the possibility of his teaching
a course at Stanford sometime.
Joe Halpern's course is a big success I think--even though there
might not be many officially signed up for it. Joe wants to teach
another course here next year, and I suppose we can just have him
do that under some other auspices. He impresses me as someone
we might want to hire someday. (He says that he wants to stay at
IBM for awhile.)
-------
∂23-Feb-85 1647 NILSSON@SU-SCORE.ARPA re: Alan Kay
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Feb 85 16:47:39 PST
Date: Sat 23 Feb 85 16:49:05-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: re: Alan Kay
To: JMC@SU-AI.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 23 Feb 85 16:05:00-PST
There's no law that states that a course started by a VIP (Fernando,e.g.)
can't be a regular course later, is there? We could have Fernando
as planned and then discuss with him making his course (and maybe him)
"regular". As far as Joe is concerned, we could just invite him
to teach a course sometime outside of the VIP program. We can keep
Alan Kay in mind for the following year.
-------
∂25-Feb-85 1029 SJG counterfactuals
If I didn't have to teach 223 because Mike is away this week, I would be
able to be at the circumscription thing on time.
Thanks for the Barwise ref. CSLI is sending me a copy.
Matt
∂25-Feb-85 1034 SJG dinner
I think not; I have plans with someone but she was very tired last I
heard and my cancel them. How about tomorrow, in any case?
Matt
∂25-Feb-85 1101 SJG short week!
Wednesday is not possible. Thursday? (I know I'm free but suspect
it is too far away to make plans ...)
Whom do you think we should inform about February being a couple of
days shorter than usual?
Matt
∂25-Feb-85 1302 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Feb 85 13:02:04 PST
Date: Mon 25 Feb 85 13:03:09-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Hello,
Chuck Cozette, of Info. Systems Magazine - Chicago, called about a release
sent out by the Univ. News Center. He wanted to talk to you about this but
didn't tell me what aspect of...
Ph: 312-462-2308.
thanks, Kim
-------
∂25-Feb-85 1354 JJW Multiprocessor Lisp
The file HEPLSP[1,JJW] contains a preliminary version of the paper we
discussed, comparing the HEP with other multiprocessors for the
purpose of implementing Qlambda. I'd appreciate it if you would look
it over and give me any comments.
∂25-Feb-85 1447 DEK
Thanks much; please send me all you have, this afternoon, so that I can
keep the pipeline full! I want to stay up as late as it takes, since
my own schedule precludes me doing much later this week.
∂25-Feb-85 1429 JMC industry
Stefik promises copy today by net mail. The quarters will be
(Pereira, Fall) Williams, Winter) (Bobrow et al, Spring)
I'll MAIL you the full information this afternoon or tomorrow morning.
∂25-Feb-85 1513 NILSSON@SU-SCORE.ARPA Re: Nilsson
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Feb 85 15:12:51 PST
Date: Mon 25 Feb 85 14:32:28-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: Nilsson
To: JMC@SU-AI.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 25 Feb 85 13:02:00-PST
I'd like to learn more about the connection machine.
-------
∂25-Feb-85 1531 RA AI and speech recoognition
Who would a Joseph Aso from Digital Design Magazine talk to re: AI
andspeech recognition?
∂25-Feb-85 1550 williams.sjrlvm1%ibm-sj.csnet@csnet-relay.arpa FP course description
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 25 Feb 85 15:49:41 PST
Received: from ibm-sj by csnet-relay.csnet id ao15561; 25 Feb 85 18:36 EST
Date: Mon, 25 Feb 85 14:51:02 PST
From: John Williams <williams%ibm-sj.csnet@csnet-relay.arpa>
To: JMC@SU-AI.ARPA
Subject: FP course description
Functional Programming -- Current research topics in the design and
implementation of functional programming languages, including formal
semantic models, rewriting rules and the algebra of programs, abstract
data types, program transformations, infinite sequences,
and the use of stream-valued stream
functions to accommodate persistent memory and interactive I/O. The
particular language FP will be studied in depth, with examples drawn
from other functional languages such as SASL, ML, KRC, and Hope.
Prerequisite: a graduate-level course in programming languages.
(Williams) by arrangement .
∂25-Feb-85 2201 JJW@SU-AI.ARPA Software development proposal
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 25 Feb 85 22:00:56 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Mon, 25 Feb 85 22:02:16 pst
Date: 25 Feb 85 2200 PST
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: Software development proposal
To: csdfacilities@SU-PESCADERO.ARPA
Based on our meeting Thursday and my discussions with Len and John on
Friday, I've made a first draft of a statement that I'd like this
committee to present at the upcoming faculty lunch. Feel free to suggest
changes to any of this.
Software development proposal
In recent years the department, CSD-CF and individual research projects
have been acquiring a wide variety of computing systems. We feel a need
to improve the communication and interaction between these systems, and
current efforts are not providing the desired level of support.
This is primarily a software problem. The software we receive from the
suppliers of our systems often needs alteration before it is usable. In
the day-to-day development of our computing environment, changes are
sometimes made that require modification of individual systems. It is not
generally possible to maintain any of our computer systems without some
continuous expense for software maintenance.
There are also large-scale software projects that require management and
support. Examples are the new file server (whose hardware is currently
sitting idle), archival systems for tape storage of files, and a coherent
approach to spooling of printed output. No effort is currently being
spent on these projects, even though they would provide a great benefit.
We propose augmenting the current staff of CSD-CF to provide the manpower
necessary to accomplish these projects. One or more people will be hired
to provide a focus for system software development efforts.
This effort will require funding to support the additional staff. The
support must come from the people who ultimately benefit from the work.
Two ways that can provide this funding are software maintenance charges
and capitalization of software.
Maintenance charges would be levied on all systems receiving the benefit
of software developed and maintained by the CSD-CF staff. When research
grants propose to buy new equipment, or pay for existing systems, they
should include the cost of this maintenance in the proposals. It would be
possible, but not recommended, for individual computer systems to opt out
of this maintenance plan, but then they would not be entitled to any of
the software developed by CSD-CF. This is only appropriate for projects
with the desire or ability to maintain their own system software.
Capitalization of software is the allocation of capital, not operating,
funds for the development of software. This is a generally accepted
practice in the business world, but up to now we have not included
adequate estimates of the cost of software development in our proposals to
funding agencies. We should look at whether unspent money in current
grants (e.g., the 3-year ARPA equipment grant) can be spent this way, and
ask for funding for software projects in future grant proposals.
∂25-Feb-85 2235 JJW@SU-AI.ARPA Software development proposal, cont'd.
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 25 Feb 85 22:35:48 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Mon, 25 Feb 85 22:37:11 pst
Date: 25 Feb 85 2235 PST
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: Software development proposal, cont'd.
To: csdfacilities@SU-PESCADERO.ARPA
Generalities are nice, but to get a feel for what we're talking about
we need to come up with specific costs for sofware maintenance and
development. Let me propose the areas of expense, and hopefully we can
come up with cost estimates.
1. Maintenance for PDP-10 systems (Score, SAIL, the new 2060):
Whatever this costs, it is already taken care of by existing
CSD-CF staff and is part of CSD-CF's budget. (Is it enough;
do we need more?)
2. Maintenance for VAX systems:
This must have already been computed in the proposal to hire
a person for this task.
3. Maintenance for other systems:
What else do we have that needs software work? (Ethertips,
Lisp Machines, Dover and other printers, gateways.)
4. Development projects:
a. File server (LaBrea): 1 man-year (?) to develop server generally
usable by a variety of other systems.
b. Archival dump system for Unix: We really need this for the file
server, and it would be useful for other systems as well. Maybe
2 man-years for the full system including network-based dumps so
that each system needn't have a separate tape drive.
c. Printer and spooling software: I think we need some work in this
area, though I'm not really sure what has to be done.
It looks to me like there's enough to justify hiring one person for the
development tasks and one for the maintenance tasks (in addition to the
VAX person).
∂26-Feb-85 0007 ROODE@SRI-NIC.ARPA [Francine Perillo <PERILLO@SRI-NIC.ARPA>: [krovetz@nlm-mcs (Bob Krovetz): online technical reports]]
Received: from SRI-NIC.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 00:07:32 PST
Date: Tue 26 Feb 85 00:08:12-PST
From: David Roode <ROODE@SRI-NIC.ARPA>
Subject: [Francine Perillo <PERILLO@SRI-NIC.ARPA>: [krovetz@nlm-mcs (Bob Krovetz): online technical reports]]
To: Amsler@SRI-AI.ARPA, Library@SU-SCORE.ARPA, JMC@SU-AI.ARPA,
Pmartin@SRI-AI.ARPA, Tyson@SRI-AI.ARPA,
decvax!ittvax!qumix!rcf@UCB-VAX.ARPA
cc: Perillo@SRI-NIC.ARPA
Location: EJ286 Phone: (415) 859-2774
This seems like useful info...
---------------
Mail-From: PERILLO created at 22-Feb-85 17:38:46
Date: Fri 22 Feb 85 17:38:46-PST
From: Francine Perillo <PERILLO@SRI-NIC.ARPA>
Subject: [krovetz@nlm-mcs (Bob Krovetz): online technical reports]
To: mgt-staff@SRI-NIC.ARPA
Here is some good information on online Technical Reports or their
indexes, per our conversation in the mgt meeting yesterday.
-Francine
---------------
Return-Path: <krovetz@nlm-mcs>
Received: from nlm-mcs.ARPA by SRI-NIC.ARPA with TCP; Thu 17 Jan 85 15:18:37-PST
Received: by nlm-mcs.ARPA (4.22/4.7)
id AA02665; Thu, 17 Jan 85 18:20:48 est
Date: Thu, 17 Jan 85 18:20:48 est
From: krovetz@nlm-mcs (Bob Krovetz)
Message-Id: <8501172320.AA02665@nlm-mcs.ARPA>
To: perillo@sri-nic
Subject: online technical reports
Fran,
Hi! I finally sent out that list of people who could be contacted
over the net to obtain tech reports. Some of the delay was mine, and
some was due to the long time it took a couple of people to respond.
In any case, the information I collected is given below:
The following is a list of people who can be contacted at various sites
on the net for ordering technical reports. I've tried to determine who
is the site contact, whether they have an on line bibliography, if they
have a mailing list for notification of new TR's, and if the TR's themselves
are available on line. If anyone knows of this information for any sites I
haven't mentioned, please send me a message and I will post a followup to the
net. Note that the mailing lists mentioned are U.S. mail, not electronic!
Online bibliographies at the various sites may be FTP'd by logging in with
id: ANONYMOUS and password GUEST (this only applies if you are on the ARPANET)
Yale: Donna Mauri (MAURI@YALE) is the contact person for AI or cognitive
science reports. There is no online list of those reports, but she
can send a hard copy list. For non-AI/cognitive science reports
the contact person is Kim Washington (WASHINGTON@YALE).
CMU: No online list, however they do have a mailing list for
notification of recent TR's. TR's can be ordered over the net.
The contact person is Sylvia Hoy (HOY@CMU-CS-A).
MIT: There is an online list, but the publications office is undergoing
a restructuring, so it isn't available at the moment. A contact
for ordering the TR's will be established at some future time.
SRI: No online list of just the report names, but there is a list of
the reports plus abstracts. Tonita Walker (TWalker@SRI-AI) is
the contact person. Many of the reports are available for FTPing.
UTEXAS: A list of current reports is in {UTEXAS}<cs.tech>TRLIST. A
master list of reports still in print is under MASTER.TR. Many
of the current reports themselves are also available in the
above directory, but they contain text formatting commands.
The directory contains a file READ.ME which tells which text
formatter was used for which reports (SCRIBE vs. NROFF).
Reports may be ordered by sending mail to CS.TECH@UTEXAS-20.
BBN: No reports or list online (no list even in hard copy). Contact
author directly about getting a copy of the TR.
PARC: Maia Pindar (PINDAR@XEROX) is the contact person. An online
copy of the bibliography is not available at the moment, but
Ms. Pindar may be contacted to obtain a hardcopy.
Rutgers: Contact Christine Loungo (LOUNGO@RUTGERS) or Carol Petty
(PETTY@RUTGERS) to obtain reports. They maintain a mailing
list to distribute notices of the TR's and the abstracts.
The abstracts of recent reports are online and under:
{RUTGERS}<library>tecrpts-online.doc.
ISI: Lisa Trentham is the contact (LTRENTHAM@ISIB). There is a list
of the available reports under {ISIB}<BBOARD>ISI-PUBLICATIONS.DOC
Stanford: Stanford reports are issued by four sources: the HPP (Heuristic
Programming Project), the AI lab, the Center for the Study of
Language and Information (CSLI), and the Computer Science
Department. HPP reports are available without charge by contacting
Paula Edmisten (EDMISTEN@SUMEX). Please be reasonable with your
requests; no more than 15 at a time! There is no online bibliography
available, but a hard copy may be requested. There is an online
bibliograpy of AI lab reports in AIMLST in [BIB,DOC]@SU-AI. Some
of the reports are available online and are so indicated in the
bibliography. Reports from CSLI may be requested from Dikran
Karagueuzian (DIKRAN@SU-CSLI). A bibliography of the reports
is stored under {SU-CSLI}<CSLI>CATALOG.REPORTS. CSLI will also
be issuing lecture notes, and a bibliography of these will be under
{SU-CSLI}<CSLI>CATALOG.LECTURE-NOTES. The reports are
available without charge, but there is a charge for the lecture
notes. There is also a charge for reports published by either
the AI lab or the Computer Science Department, but queries as
to cost and/or availablity may be sent to Kathy Berg (BERG@SU-SCORE)
A bibliography of CSD reports from 1963 to 1984 is available for
$5.00. The department maintains a mailing list for notification
of new TR's. You can be added to it by contacting Kathy Berg.
Updates are sent out about five or six times per year.
-bob
-------
-------
∂26-Feb-85 0925 BETSY@SU-CSLI.ARPA Budget Cuts
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 09:25:08 PST
Date: Tue 26 Feb 85 09:23:31-PST
From: Betsy Macken <BETSY@SU-CSLI.ARPA>
Subject: Budget Cuts
To: initiators@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA, joyce@SU-CSLI.ARPA, jamie@SU-CSLI.ARPA
John and I want to be sure that we have heard your views about how
best to make the budget cuts needed for the coming year and for
the following three years.
What is the best way to characterize the research activities that
form the core of Project SL? of CSLI?
Which "constellations" of researchers are carrying out these
activities?
What CSLI services do you most need?
What about the "operant pot" and initiator funds?
In short, what is the best way we can arrange things at CSLI to: help
you achieve your research goals, continue the development of the "new
science" that seems to be emerging, make our SDF money last as long as
possible, and be in a good position to establish alternative sources
of funding.
I would like to schedule a time to talk with each one of you and
others who are playing key roles in the constellations. We should
allow at least an hour. We could meet for lunch at the Faculty Club
or arrange some other time. Right now The week of March 4 is clear
for me EXCEPT for the afternoon of Tuesday March 5. Monday through
Wednesday of the following week (March 11 - 13) are clear too.
Would you let Ingrid know when you would like to meet?
Thanks.
Betsy
-------
∂26-Feb-85 1002 @SRI-AI.ARPA:AAAI-OFFICE@SUMEX-AIM.ARPA Term of the Chairs and the Secretary-Treasurer
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 10:02:34 PST
Received: from SUMEX-AIM.ARPA by SRI-AI.ARPA with TCP; Tue 26 Feb 85 10:05:05-PST
Date: Tue 26 Feb 85 09:58:53-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Term of the Chairs and the Secretary-Treasurer
To: amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Brachman@SRI-KL.ARPA,
Charniak-brown@CSNET-RELAY.ARPA, KRD@MIT-MC.ARPA, Engelmore@SUMEX-AIM.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SRI-AI.ARPA, McDermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA,
Rich@MIT-MC.ARPA, Fikes@USC-ECL.ARPA, stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Tenenbaum@SRI-AI.ARPA, Buchanan@SUMEX-AIM.ARPA,
Winston@MIT-MC.ARPA, Stefik@XEROX.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
During the last Executive Council meeting, there was some discussion
about limiting the term of the chairs of the Standing Committees
(e.g. Conference, Publication, Membership) and the position of the
Secretary/Treasurer from an indefinite period of time to a specific
term.
Some people recommended that the term be limited to two years
for the Chairs and the Secretary/Treasurer commencing in 1986.
Any change would be reflected in an amendment to the By-Laws which
would be approved by a majority vote by the membership.
There are two issue here -- should the term be limited at all?
If so, what term is appropriate? Two years? Three years?
I would like to hear your comments on this matter at your
convenience.
Regards,
Claudia
-------
∂26-Feb-85 1023 Stefik.pa@Xerox.ARPA CS 390 -- 2nd time around
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 10:23:35 PST
Received: from Tokay.ms by ArpaGateway.ms ; 26 FEB 85 10:24:48 PST
Date: 26 Feb 85 10:23 PST
From: Stefik.pa@XEROX.ARPA
Subject: CS 390 -- 2nd time around
To: DKE@SU-AI.ARPA, JMC@SU-AI.ARPA
cc: Stefik.pa@XEROX.ARPA
Prof McCarthy,
Here's the course description. Let me know if you need more
information. We may shuffle the instructors somewhat since one or two
others have expressed an interest in contributing to the course.
--------------------
CS 390. Programming Languages for AI Systems. This course will
consider the design of programming languages to provide computational
mechanisms for AI research and expert systems. Topics include
object-oriented and access-oriented programming, logic programming,
unification algorithms, representation of dependencies, contexts and
layers, representations of assumptions, algorithms for truth
maintenance, constraints, meta-circular interpreters, and architectures
for reflection. Prerequisites: Working familiarity with Lisp. Bobrow,
de Kleer, Kahn, Mittal, and Stefik. (Spring 1986.)
∂26-Feb-85 1023 Stefik.pa@Xerox.ARPA CS 390
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 10:22:44 PST
Received: from Tokay.ms by ArpaGateway.ms ; 26 FEB 85 09:52:45 PST
Date: 26 Feb 85 09:52 PST
From: Stefik.pa@XEROX.ARPA
Subject: CS 390
To: JMC@SU-AI.ARPA
cc: KSA↑.pa@XEROX.ARPA, deKleer.pa@XEROX.ARPA
Prof McCarthy,
Here's the course description. Let me know if you need more
information. We may shuffle the instructors somewhat since one or two
others have expressed an interest in contributing to the course.
--------------------
CS 390. Programming Languages for AI Systems. This course will
consider the design of programming languages to provide computational
mechanisms for AI research and expert systems. Topics include
object-oriented and access-oriented programming, logic programming,
unification algorithms, representation of dependencies, contexts and
layers, representations of assumptions, algorithms for truth
maintenance, constraints, meta-circular interpreters, and architectures
for reflection. Prerequisites: Working familiarity with Lisp. Bobrow,
de Kleer, Kahn, Mittal, and Stefik. (Spring 1986.)
∂26-Feb-85 1035 DEK I got Stefik's note just in time, and...
it raises a question. What is the name of your programming
language: Lisp or LISP?
So far the catalog description consistently says LISP everywhere
except in one place where it refers to a Lisp machine.
Wirth calls his language Pascal, since it's not an acronym.
Conversely, it seems LISP is right, since it is an acronym?
∂26-Feb-85 1053 LEP Industrial Lectureship Committee
What's going on as far as this committee goes? Am I supposed to be doing
anything?
- Leslie
lep
apology
I owe you an apology for never calling a meeting but just doing it
again. I just finished the last bit of it. For a long time there
weren't any applicants, but a little beating the bushes got the
required number. Fernando Pereira of SRI will talk about logic programming
and natural language in the Fall. John Williams of IBM will talk
about functional programming in the Winter. Daniel Bobrow, Mark
Stefik and others from Xerox will talk about AI languages in Spring.
My excuse is that I never asked for a committee in the first place,
and in matters like this it's more work to divide up the work than
to just do it.
∂26-Feb-85 1130 RA MAD
John Nafeh called; he'd like to meet with you either tomorrow (Wed.) morning
or Thursday afternoon. His tel. (408) 943 1711.
∂26-Feb-85 1146 NILSSON@SU-SCORE.ARPA Re: industrial lectureships
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 11:46:21 PST
Date: Tue 26 Feb 85 11:38:04-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: industrial lectureships
To: JMC@SU-AI.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 26 Feb 85 11:11:00-PST
Can we ask Betty Scott to handle the financial arrangements relating
to the industr. profs? The min. of 1/16 annual salary or $3000 sounds
fine to me. John Williams would probably come under the same terms
as did Joe Halpern? You could tip me off whenever you think that
one of the vis. profs comes from a company that would feel charitably
toward donating a person's services, and then I could follow up.
(But I don't want to spend $3000 worth of my effort getting someone
to save us $3000.)
-------
∂26-Feb-85 1158 BSCOTT@SU-SCORE.ARPA Joint U.S.-Japanese Cooperative Research
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 11:58:51 PST
Date: Tue 26 Feb 85 11:56:07-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Joint U.S.-Japanese Cooperative Research
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John,
This grant has been received: $37,168 for period 4/1/85 - 9/30/87.
Betty
-------
∂26-Feb-85 1355 DEK
309. Industrial Lectureships in Computer Science ---
Each quarter the Computer Science Department invites one outstanding computer
scientist from the local industry to give a course in his or her
specialty. These courses (309A,B,C) are ordinarily given only once.
Lecturers and topics change from year to year, hence courses with this
number may be taken repeatedly.
309A. Prolog and Natural Language Analysis ---
Introduces the logic programming language Prolog as a tool for
natural language analysis and related topics in artificial
intelligence, through a progression of natural language analysis
examples. No previous experience with logic programming or natural
language analysis is required. The following topics will be
discussed: representing context-free grammars in Prolog; definite
clause grammars; the logical variable; difference lists; top-down
parsing and the Prolog execution model; syntactic analysis of complex
constructions; semantic translation rules and logical form; general
computations in grammars; structure manipulation and multistage
analysis; operations on logical forms; deductive question-answering in
Prolog; metalevel computation and the embedding grammar formalisms in
Prolog; extralogical operations; implementation of alternative parsing
algorithms; the organization of a natural-language question-answering
system. Examples will be available as running Prolog programs and
will be used for exercises. Prerequisites: elementary notions of
logic, formal language theory, and symbolic computation.
3 units, Aut (Pereira)
309B. Functional Programming -- Current research topics in the design and
implementation of functional programming languages, including formal
semantic models, rewriting rules and the algebra of programs, abstract
data types, program transformations, infinite sequences, and the use of
stream-valued stream functions to accommodate persistent memory and
interactive input/output. The particular language FP will be studied in
depth, with examples drawn from other functional languages such as SASL,
ML, KRC, and Hope. Prerequisite: a graduate-level course in programming
languages.
3 units, Win (Williams)
390C. Programming Languages for AI Systems.---The
design of programming languages to provide computational
mechanisms for AI research and expert systems. Topics include
object-oriented and access-oriented programming; logic programming;
unification algorithms; representation of dependencies, contexts and
layers; representations of assumptions; algorithms for truth
maintenance; constraints; meta-circular interpreters; architectures
for reflection. Prerequisites: Working familiarity with LISP. Bobrow,
de Kleer, Kahn, Mittal, and Stefik. (Spring 1986.)
3 units, Spr (Bobrow, de Kleer, Kahn, Mittel, Stefik)
∂26-Feb-85 1430 FY LISP machine
To: bosack@SU-SCORE.ARPA
CC: YM@SU-AI.ARPA, MA@SU-AI.ARPA, ZM@SU-AI.ARPA, JMC@SU-AI.ARPA
Do you have any prognosis on how soon the lisp machine will be moved
to 324?
Frank
∂26-Feb-85 1438 VAL
Reminder: you speak about "Unsolved Problems" tomorrow. - Vladimir
∂26-Feb-85 1506 NILSSON@SU-SCORE.ARPA [NAVARRO@SRI-AI.ARPA: missing keys]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 15:06:30 PST
Date: Tue 26 Feb 85 15:05:45-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: [NAVARRO@SRI-AI.ARPA: missing keys]
To: jmc@SU-AI.ARPA
SRI is wondering about its missing keys!
---------------
1) 26-Feb NAVARRO@SRI-AI.ARPA missing keys
2) 26-Feb To: NAVARRO@SRI-AI.A Re: missing keys
Message 1 -- ************************
Return-Path: <NAVARRO@SRI-AI.ARPA>
Received: from SRI-AI.ARPA by SU-SCORE.ARPA with TCP; Tue 26 Feb 85 14:16:44-PST
Date: Tue 26 Feb 85 14:18:15-PST
From: NAVARRO@SRI-AI.ARPA
Subject: missing keys
To: nilsson@SU-SCORE.ARPA
cc: navarro@SRI-AI.ARPA
Guess what Nils??? I have the task of tracking down all the keys that are
out in your name.... There are only 12 of them. Could you check with
John McCarthy and see if he still has his key? It is DD-773. Stan is
checking with his brother Jeff who has one. Then there is Greg Jirak and
2 to Adrian King, and some others that don't have any names attached. Any
help you can give would be greatly appreciated. Thanks,
... Georgia
-------
Message 2 -- ************************
Mail-From: NILSSON created at 26-Feb-85 15:01:54
Date: Tue 26 Feb 85 15:01:54-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: missing keys
To: NAVARRO@SRI-AI.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "NAVARRO@SRI-AI.ARPA" of Tue 26 Feb 85 14:16:48-PST
ok, I'll check with John (by sending a copy of your note to him), and
ask him to cough up his key if he has one. -Nils
-------
-------
∂26-Feb-85 1546 CHRIS@SU-CSLI.ARPA Hintikka lunch
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 26 Feb 85 15:46:58 PST
Date: Tue 26 Feb 85 15:46:38-PST
From: Chris Menzel <CHRIS@SU-CSLI.ARPA>
Subject: Hintikka lunch
To: finterest@SU-CSLI.ARPA
cc: chris@SU-CSLI.ARPA
One last call for those who didn't respond the first time. I am organizing
a lunch with Hintikka sometime between March 11 and March 18 for those
interested in issues related to his work in logic, philosophy of logic, etc.
Please let me know if you are interested, since I'm working on scheduling
the time. --Chris
-------
∂26-Feb-85 1614 RA Les Earnest
Please call him at (56) 986 9400.
∂27-Feb-85 0900 JMC*
Call Kahn.
∂27-Feb-85 0910 JMC*
Bukovsky
∂27-Feb-85 1125 RA John Nafeh
John would like to meet with you if possible tomrrow afternoon. He is willing
to come to your office. His tel. (56) 943 1711.
∂27-Feb-85 1126 RA press release follow up
Chuck Cozette from Information Systems Computer Magazine would like to
do a follow up about Stanford University press release re AI at Stanford.
His tel: (312) 462 2308. He'll try to call again later.
∂27-Feb-85 1442 RA [Reply to message recvd: 27 Feb 85 13:57-PST]
3:00pm tomorrow is ok for John Nafeh. Would you like him to come to your
office or would you like to go there. Let me know and I'll call him.
∂27-Feb-85 1452 RA John Nafeh
John Nafeh called again. 11:00am will be better for him. He'll take you to
lunch if you come to his office, but is willing to come to yours.
∂27-Feb-85 2251 LLW@S1-A.ARPA "Hail, Anubis, . . . "
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 27 Feb 85 22:51:03 PST
Date: 27 Feb 85 2253 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: "Hail, Anubis, . . . "
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂19-Feb-85 1259 JMC@SU-AI.ARPA interview
Received: from SU-AI.ARPA by S1-A.ARPA with TCP;
19 Feb 85 12:59:37 PST Date: 19 Feb 85 1300 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: interview
To: llw@S1-A.ARPA
I have been interviewed in two sessions. They predict some action in two
to four weeks.
[John: Indeed! Two interviews--particularly of the lengths involved--are
essentially unheard out, by me or anyone locally. I've continued to pound on
The System from this end, and was informed yesterday that your entire
(massive) file had just been sent to Washington for review (which action
is unprecedented in my knowledge--all final decisions are *always* made in
the San Francisco Regional Office, where you were interviewed). I've
thrown fistfuls of unprecedentedly large denomination chips down on the
table in order to move things this far, though the pace has been
glacial--I sure hope that the Washington weighing of your file's contents
against a feather turn out well! Lowell]
∂27-Feb-85 2309 LLW@S1-A.ARPA 'Tis Far More Blessed To Win Than To Lose. . .
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 27 Feb 85 23:08:51 PST
Date: 27 Feb 85 2311 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: 'Tis Far More Blessed To Win Than To Lose. . .
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂27-Feb-85 2302 JMC@SU-AI.ARPA re: "Hail, Anubis, . . . "
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 27 Feb 85 23:01:03 PST
Date: 27 Feb 85 2257 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: re: "Hail, Anubis, . . . "
To: LLW@S1-A.ARPA
[In reply to message sent 27 Feb 85 2253 PST.]
In 70 years one can accumulate a lot of sins - some of mine are prenatal.
Thanks again, and I hope that if it all works out I can do something
helpful to your enterprises.
[John: I'm pleased to have done all that I have in order to make this
affair turn out happily; however, it has been necessary to drive
surprisingly far into the non-linear regime in order to move matters even
to the present juncture, and there are significant forfeits to be paid if
my concatenated gambits are smashed (unless Edward can rescue them, which
is rather doubtful). Let's hope for the best! Lowell]
∂28-Feb-85 0030 FEIGENBAUM@SUMEX-AIM.ARPA Bob Kahn getogether
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 00:30:25 PST
Date: Thu 28 Feb 85 00:30:00-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Bob Kahn getogether
To: delagi@SUMEX-AIM.ARPA, rindfleisch@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
cc: nii@SUMEX-AIM.ARPA
Bob will be out here for a conference on March 8. I've arranged to have
the evening with him--dinner plus after-dinner conversation. He wants to
clarify his thinking about emulation of parallel architectures, the
second-copy-of-MIT-Emulator idea, and the JMC Sequent proposal. He wants
to get all the facts clear in his head--who's doing what, for what purpose.
I propose that we all manage to get together at my house at 9pm to do this.
But those who also want to go to dinner with Bob and Penny and me are welcome
to do that also (time not yet established). Let me know.
Ed
-------
∂28-Feb-85 0859 WIEDERHOLD@SUMEX-AIM.ARPA Industrial lecturers
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 08:59:22 PST
Date: Thu 28 Feb 85 08:58:58-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Industrial lecturers
To: jmc@SU-AI.ARPA
I suggested to Reid Smith, at Schlumberger Doll Research in Connecticut
that he might be suitable etc for such a lecture ship.
He is working on nice knowledge base tools.
Do we have description of the course to send him? Gio
-------
∂28-Feb-85 0930 yorick%nmsu.csnet@csnet-relay.arpa
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 09:30:17 PST
Received: from nmsu by csnet-relay.csnet id al13061; 28 Feb 85 12:16 EST
Received: by nmsu.csnet (4.12/)
id AA26048; Wed, 27 Feb 85 17:47:59 mst
Date: Wed, 27 Feb 85 17:47:59 mst
From: Yorick Wilks <yorick%nmsu.csnet@csnet-relay.arpa>
To: jmc@su-ai.ARPA
John,
Are you going to come to our methodology in AI workshop?
Hope so---it was some remarks of yours that caused the guys here to set it
up.
Best regrards,
Yorick Wilks.
∂28-Feb-85 0951 JMC
Technical Report 5172:TR:85
Caltech Computer Science
Caltech 256-80
Pasadena, CA 91125
Unfortunately, they charge $4 for a copy!
∂28-Feb-85 0950 RA John Nafeh
Reminding you of your meeting with John Nafeh at 11:00 today at your
office.
∂28-Feb-85 1026 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Next seminar:
Speaker: Vladimir Lifschitz
Topic: Computing Circumscription
Time: 2-3 pm, Wednesday, March 6
Place: MJH 301 (not 252!)
∂28-Feb-85 1136 RA Speech recognition
Brita Meng from Digital Magazine needs to talk to someone re speech
recognition. Could you give me a name of a person whom she can
contact?
∂28-Feb-85 1249 SJG Thursday is upon us!
Are you still free for dinner? (I need to know by about 4 ...)
Talk to you soon -
Matt
∂28-Feb-85 1435 RA
It's Thursday and I leave early for my class. See you tomorrow.
∂28-Feb-85 1542 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA paper for the next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 15:42:31 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 28 Feb 85 15:41:29-PST
Date: Thu 28 Feb 85 11:35:12-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: paper for the next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
Remember, the next F4 meeting will be next Monday, March 4, and Dick
Jeffrey will give a presentation. Those of you who don't yet have a
copy of Dick's paper, "Probability and the Art of Judgement," can get
it either from Ingrid Deiwiks at Ventura or from me at SRI.
--Bob
-------
∂28-Feb-85 1553 SJG dinner
see you at 6.
∂28-Feb-85 1751 RINDFLEISCH@SUMEX-AIM.ARPA Re: Bob Kahn getogether
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 17:51:10 PST
Date: Thu 28 Feb 85 17:50:48-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Re: Bob Kahn getogether
To: FEIGENBAUM@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
cc: nii@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA
In-Reply-To: Message from "Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>" of Thu 28 Feb 85 00:30:07-PST
The evening of March 8th is good for me, Ed. I'd also be interested in
dinner as things stand now.
Tom R.
-------
∂28-Feb-85 1936 BARWISE@SU-CSLI.ARPA Kit Fine
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 19:36:31 PST
Date: Thu 28 Feb 85 19:36:24-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Kit Fine
To: Finterest@SU-CSLI.ARPA
I would like to draw attention to Kit Fine's talk next week. Mention
it to your logical and philosophical friends. It should be
interesting. We will go out to dinner afterwards. let me know if you
might like to go.
-------
∂28-Feb-85 2003 cheriton@Pescadero Mail problem
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 20:03:00 PST
Date: Thu, 28 Feb 85 20:04:35 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Mail problem
To: jmc@su-ai
I have had the following response to several messages I have sent to
faculty@score.
From Mailer@SU-SCORE.ARPA Thu Feb 28 11:52:32 1985
Received: from SU-SCORE.ARPA by Pescadero with TCP; Thu, 28 Feb 85 11:52:29 pst
Date: Thu 28 Feb 85 11:48:52-PST
From: The Mailer Daemon <Mailer@SU-SCORE.ARPA>
To: cheriton@SU-PESCADERO.ARPA
Subject: Message of 28-Feb-85 11:48:26
Status: R
Message failed for the following:
JMC-LISTS@SU-SCORE.ARPA.#Internet: No such directory name
------------
Received: from Pescadero by SU-SCORE.ARPA with TCP; Thu 28 Feb 85 11:48:27-PST
Date: Thu, 28 Feb 85 11:48:14 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: Course renumbering
To: WIEDERHOLD@SU-Score, dek@Sail, faculty@SU-Score
Cc: shortliffe@Sumex-Aim
CS 344AB seems to be inappropriate for reasons others have mentioned,
namely:
1. 344A (currently 244) is not advanced material but basic stuff that is
taught in many good undergrad programs. Typical undergrad/grad course.
2. 344B (currently 347) is not a logical continuation of 344A, at least
the way I teach the former. 344B is as much to do with queuing theory
as computer networks. I am particularly concerned about this
sequence since I can see the clear need for a continuation of the
current CS 244 material, besides the distributed systems course.
In that vein, assuming the undegrad problem was to come to pass, my ideal
is to make current cs244 an undergrad course and have a next level course
at the grad level. Is it possible to do the numbering to allow for this
occurence. I do, however, expect that many incoming grad students will
still need/want to take the equivalent of the current cs 244.
-------
∂28-Feb-85 2100 JMC*
jjw on debugging
∂28-Feb-85 2238 REGES@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 22:38:01 PST
Date: Thu 28 Feb 85 22:38:56-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 28 Feb 85 22:34:00-PST
Office: Margaret Jacks 210, 497-9798
Gio pointed that out to me and I corrected the mistake yesterday.
-------
∂28-Feb-85 2259 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Feb 85 22:59:48 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 28 Feb 85 22:58:54-PST
Date: 28 Feb 85 2251 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Seminar in Logic and Foundations of Mathematics
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Joel Berman, Univ. of Illinois at Chicago
Title: Truth, fixed-points and clones
Time: Tuesday, March 5, 1985 at 4:15-5:30 P.M.
Place: Room 381-T, Math Corner, Stanford
Abstract:
Several examples are presented of propositional logics for which there
is a partially ordered set P and a natural correspondence between the
sentences of the logic and the family of monotonic operations on P.
Also presented is a general result which guarantees, for partially
ordered sets P and Q, that Q is isomorphic to the set of fixed-points
of some monotonic function on P. These results are used to amplify a
recent paper by Albert Visser, "Four-valued semantics and the liar".
The talk represents work done jointly with W.J.Blok.
∂01-Mar-85 0511 OHLANDER@USC-ISI.ARPA Re: Nilsson
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 1 Mar 85 05:11:21 PST
Date: 1 Mar 1985 08:12-EST
Sender: OHLANDER@USC-ISI.ARPA
Subject: Re: Nilsson
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: nilsson@SU-SCORE.ARPA
Message-ID: <[USC-ISI.ARPA] 1-Mar-85 08:12:06.OHLANDER>
In-Reply-To: The message of 25 Feb 85 1302 PST from John McCarthy <JMC@SU-AI.ARPA>
John,
I have found out that there is not a lot of literature on the
connection machine just now. We are arranging for Danny Hillis at
TMC to contact you and Nils to see if you are interested in getting
first hand information on what is happening in regard to the connection
machine effort.
Ron
∂01-Mar-85 0842 BARWISE@SU-CSLI.ARPA David Harel
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Mar 85 08:42:02 PST
Date: Fri 1 Mar 85 08:39:57-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: David Harel
To: Pereira@SU-CSLI.ARPA, Goguen@SU-CSLI.ARPA, Meseguer@SU-CSLI.ARPA,
Stan@SRI-AI.ARPA, JMC@SU-AI.ARPA, Tw@SU-AI.ARPA
cc: Vardi@SU-CSLI.ARPA
DAvid Harel has written asking for support so he could come here for
8-10 weeks this summer. Since the only source of funds for this kind
of thing comes from initiators, I was wondering if any you were
interested in using some of your initiator funds for this. He seems
like a very good person, but it is unclear to me whether his work will
contribute directly to anything any of you are working on.
-------
∂01-Mar-85 0853 FFL Search Committee meeting
To: JMC, FFL
It is decided that the Robotics Search Com. will meet at 11 a.m., Tuesday,
Feb. 5, in Chairman's Conference Room. The hold on Wed., Feb. 6, at
2 p.m. should be removed.
∂01-Mar-85 0911 STAN@SRI-AI.ARPA Re: David Harel
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 1 Mar 85 09:11:03 PST
Date: Fri 1 Mar 85 09:10:57-PST
From: STAN@SRI-AI.ARPA
Subject: Re: David Harel
To: BARWISE@SU-CSLI.ARPA
cc: Pereira@SU-CSLI.ARPA, Goguen@SU-CSLI.ARPA, Meseguer@SU-CSLI.ARPA,
JMC@SU-AI.ARPA, Tw@SU-AI.ARPA, Vardi@SU-CSLI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Fri 1 Mar 85 08:43:30-PST
I know Harel and agree he is a very good person. I would chip in some
of my initiator funds if others would do the same. About how much is
needed overall?
--Stan
P.S. to Jon: What did you decide finally about Gaifman? I understand
the Math dept's bind. The AI Center can provide partial support, but
some CSLI contribution would be needed as well. I'd like to reply to
Haim within the next few days.
-------
∂01-Mar-85 1016 INGRID@SU-CSLI.ARPA Abstract for Summer School
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Mar 85 10:16:36 PST
Date: Fri 1 Mar 85 10:16:43-PST
From: Ingrid Deiwiks - 497-3084 <INGRID@SU-CSLI.ARPA>
Subject: Abstract for Summer School
To: jmc@SU-AI.ARPA
Dear Prof. McCarthy,
Do you think you could let me have a short abstract for your talk
"Formalized non-monotonic reasoning with applications to artificial
intelligence" by Monday morning, Mar 4, please?
Ingrid
-------
∂01-Mar-85 1224 AAAI-OFFICE@SUMEX-AIM.ARPA Two Recommendations from the Conference Committee
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 1 Mar 85 12:23:40 PST
Date: Fri 1 Mar 85 11:41:13-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Two Recommendations from the Conference Committee
To: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Davis%MIT-OZ@MIT-XX.ARPA, Genesereth@SUMEX-AIM.ARPA,
Buchanan@SUMEX-AIM.ARPA, Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA,
JMC@SU-AI.ARPA, MCdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA,
Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Stefik@XEROX.ARPA, tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
The Conference Committee (composed of Marty Tenenbaum,Ron Brachman and
Mike Genesereth) have been deliberating over two issues -- the AAAI's
working with other groups on meetings and presence of two AAAI conferences
a year -- for the last several months. Below are their recommendations
for your review and comments.
They are particularly interested in getting a consensus about the two
conferences a year proposal so that the program and logistical planning
for the 1986 and 1987 Conferences as soon as possible.
I look forward to hearing your comments.
Regards,
Claudia
DRAFT COOPERATION POLICY STATEMENT
AAAI POLICY FOR COOPERATION WITH OTHER ORGANIZATIONS ON TECHNICAL MEETINGS
The purpose of the AAAI is to promote scientific interchange among
interested parties on AI-related topics. As a scientific society we
look to other organizations to help further our goals by cooperating
with them on meetings on narrowly defined technical topics. In
principle, the AAAI will consider cooperating with other groups on
meetings that do not conflict with the AAAI's scientific and
educational goals.
In return, the AAAI will allow the cooperating organization to use the
membership mailing list and/or place a display ad in the AI Magazine
announcing the meeting to AAAI members free of charge.
As a means of assessing each request for cooperation, the AAAI will
apply the following guidelines to every request.
1. "NATIONAL CONFERENCE"
AAAI prefers not to endorse a meeting in any AI topic area called
"National Conference". The AAAI Conference Committee strongly prefers
to endorse Workshops, or perhaps "Symposia." If a national conference
is proposed whose major area of concern is not AI, but is related
(e.g. imagine that the AMA sponsors its major conference with a
section on Computers in Medicine (including AI)), the Committee will
certainly consider cooperating with that organization. However,
national conferences that temporally overlap AAAI conferences and its
sponsored activities will not be considered.
a. If AAAI has already endorsed a workshop in a certain topic area,
then it will not endorse another one that significantly overlaps that
topic and occurs close in time to the previously endorsed meeting.
Overlapping topics and the degree of temporal conflict will be
determined by the AAAI Conference Committee.
b. AAAI will not endorse any meeting that occurs close in time to one
of its National Conferences [closeness in time must be determined],
unless that meeting is coordinated with the one of the AAAI Program
Chairs so to enhance that AAAI Conference.
2. FOCUS
The topical focus of any approved meeting must be narrow and well defined.
3. REVIEW STANDARDS
The reviewing standards for papers must be clear and acceptable to the
Conference Committee. We must know exactly the composition of the
program committee, the method of paper review, final responsibility on
the decision to accept or reject, and the criteria used in making the
decision. The goal is only to support meetings that subscribe to the
same general policy as AAAI regarding acceptance of only the highest
quality papers, within a fair and equitable review framework.
a. At least a majority of the Program Committee and/or paper
reviewers must represent the broader interests of the AI community and
should not represent any particular special-interest group. The AAAI
Conference Committee requests that the composition of the program
committee and/or the paper reviewers be presented to them as a part of
the application (see below for more details about the application).
b. If a workshop is by invitation only, the sponsors
responsible for extending the invitations are requested to present to
the AAAI Conference Committee the names of the invitees and their
method of selection of those individuals.
In the both cases noted above, the AAAI wants to insure that the broad
interests of the AI community are represented in its sponsored events.
4. TUTORIALS
If the meeting intends to offer Tutorials on AI Topics to
participants, then AAAI must find the speakers acceptable, using the
same criteria as above with respect to maintaining high quality and
fair representation to the broader AI community. Since the tutorial
revenues are such a large contributor to the financial health of the
AAAI, the AAAI needs to evaluate the financial impact of its
association with other organizations that sponsor AI-related
tutorials. In order to maintain our principal revenue source, the AAAI
requests that 20% of the gross revenue from that meeting's tutorials
be paid to the AAAI. In return, the AAAI will facilitate the tutorial
organizers by identifying AI tutorial topics and possible speakers.
5. INCOME FROM THE MEETING
The AAAI requests information on who would financially benefit from
this proposed meeting and the means of collection and distribution of
monies from the meeting.
The AAAI requests that its members receive the same discount for
registration fees and the purchase of that meeting's proceedings as
the sponsoring society's (e.g. IEEE) members.
6. DOCUMENTATION
All documentation offered to participants at the meeting should be
sent, free of charge, to at least the chairman of the AAAI Conference
Committee. In particular, we need to receive any conference programs
and proceedings as soon as possible.
7. OUTSTANDING PAPERS
The chair of the workshop must agree to recommend to AAAI any papers
presented at the meeting that are considered seminal and of interest to
the national AI audience. These papers will be considered for
re-presentation at one of the AAAI Conferences.
APPLICATION FOR COOPERATION
The requestor is asked to send a letter which includes the following
information to the Executive Director of the AAAI.
1. Statement of the goals and objectives of the meeting;
2. Identification of the topic;
3. Proposed date and location of the meeting;
4. Identification of the meeting's sponsors and proposed
Program Committee members and/or paper reviewers; method of
paper review; the parties responsible for the final decisions
on the papers;
5. Information on Tutorial Topics, if appropriate; stated
agreement to pay the AAAI 20% of the gross tutorial
revenues;
6. Information about the method of collection and distribution
of monies and the organization who would benefit from the
meeting; and
7. A blanket agreement to comply with the other guidelines noted
above.
The Executive Director will circulate the request to the AAAI Conference
Committee, the President and the Workshop Chair.
Approvals for cooperation will come from the AAAI Conference Committee,
the AAAI President, and/or Executive Director. Approval will be sent to
the requestor in a formal letter signed by either the Chair of the
Conference Committee, the President or the Executive Director.
The approval letter will indemnify the AAAI from any financial or
other responsibilities, losses or damages.
TWO CONFERENCES A YEAR PROPOSAL
To: AAAI Executive Council
From: Conference Committee ( Marty Tenenbaum, Chair; Ron Brachman,
Michael Genesereth)
Re: Recommendation for two conferences per year
The principal objectives of any conference are to convey timely
information that address the particular needs of its attendees and to
allow richer, one-to-one conversations among the attendees. When
either objective is not satisfactorily met, then the success of
subsequent conferences becomes doubtful.
It has come to the attention of the Conference Committee that AAAI
Conferences have reached a precipitous point. As the size of the
NCAI grows, numerous problems (e.g. inadequate facilities; inability
of researchers to find other researchers and confer with each other;
rigorous review process that eliminates less novel engineering
applications) have arisen.
As a result of these developments, the Conference Committee has
spent the last four months evaluating this situation and have
prepared the following recommendation.
The Conference Committee recommends that the AAAI sponsor two
conferences per year - the Annual Conference on AI Research and the
National Conference on Artificial Intelligence - for the primary
purpose of improving the quality of scientific and technological
exchange.
Annual Conference on AI Research ("AI Science Conference")
(location: initially in hotels, later at universities; time: summer
(late July))
This conference would continue as a contributed paper conference with
a strictly scientific research orientation without the presence of
tutorials or exhibits. Papers would continue to be strongly reviewed
by the traditional AAAI review process. Invited papers and lectures
and panels as well as recommended papers from special-interest
workshops would be included on the program. In every instance, a
strong theoretical orientation would be emphasized although excellent
application papers from the National Conference on Artificial Intelligence
would be invited to this conference. In fact, the exchange of outstanding
papers from both conferences would be strongly encouraged.
The National Conference on Artificial Intelligence
(location: large convention facilities; time: late Fall or Winter)
Although the name of the traditional AAAI conference would remain the
same, its identify would clearly shift to a conference that emphasizes
the technological and engineering merits of AI applications. Unlike
the "Science" Conference, the NCAI would use a different set of
reviewing standards that emphasizes "proof in concept" and less novel
methodologies as well as would encourage a breadth of topical interests.
As an outcome of the reviewing process, guidelines for systems
descriptions (as represented in examples as R1) would be developed and
serve as a standard for future descriptions. A hierarchy of accepted
papers (similar to the IJCAI format) of long and short papers and
poster sessions would be used as the structure to the conference program.
Besides invited panels and lectures, the conference's program would
include a set of tutorials and an exhibit program.
If this recommendation is accepted by the Executive Council, two
conference format would be effective in 1986 DEPENDENT upon the
availability of hotel and university facilities and the scope of
damage from the cancellation of hotel contracts.
-------
∂01-Mar-85 1546 LES DARPA proposal
To: JMC, CLT, RPG
I finally reached Bob Kahn a little while ago and inquired about the state
of review. He said that the proposal was in the hands of Steve Squires
(Squires@ISI), who is on his staff. I have since set a message to Squires
politely inviting feedback.
∂02-Mar-85 0823 BUCHANAN@SUMEX-AIM.ARPA Re: Two Recommendations from the Conference Committee
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 2 Mar 85 08:23:28 PST
Date: Sat 2 Mar 85 08:20:25-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Re: Two Recommendations from the Conference Committee
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Davis%MIT-OZ@MIT-XX.ARPA, Genesereth@SUMEX-AIM.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, JMC@SU-AI.ARPA,
MCdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA,
Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA,
tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Fri 1 Mar 85 11:41:39-PST
One of the bugs in the IEEE conference on applications of AI, which
was co-sponsored by the AAAI, was that the AAAI membership did not
receive the call for papers in time to act on it. I would like to
see some wording in the co-sponsorship agreements to the effect that
AAAI members will receive the call for papers when everyone else does.
[In return, we could supply the mailing list for free.]
bgb
-------
∂02-Mar-85 1648 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 2 March 1985
Previous Balance 7.04
Monthly Interest at 1.5% 0.11
-------
TOTAL AMOUNT DUE 7.15
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
Your last Pony payment was recorded on 10/13/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂03-Mar-85 0756 AS80@CMU-CS-A.ARPA RE: any literature on history of ideas in Computer Science
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 3 Mar 85 07:56:48 PST
Date: 3 Mar 85 1058 EST (Sunday)
From: Alan.Sobel@CMU-CS-A.ARPA
To: Bonnetain@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
Subject: RE: any literature on history of ideas in Computer Science
Message-Id: <03Mar85.105824.AS80@CMU-CS-A.ARPA>
There is a CMU tech report by Allen Newell titled 'Intellectual Issues
in the History of Artificial Intelligence' that speaks to some of those
ideas. I'm also interested in the subject. If you hear of anything
more I'd appreciate it if you let me know. Thanks.
Alan
∂03-Mar-85 1451 @SU-CSLI.ARPA:harel%wisdom.bitnet@WISCVM.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 3 Mar 85 14:51:18 PST
Received: from WISCVM.ARPA by SU-CSLI.ARPA with TCP; Sun 3 Mar 85 14:52:50-PST
Received: from (ROOT)WISDOM.BITNET by WISCVM.ARPA on 03/03/85 at
16:50:57 CST
From: David Harel <harel%wisdom.bitnet@WISCVM.ARPA>
Date: Sun, 3 Mar 85 14:18:16 -0200
Received:
To: jmc@su-csli.arpa ,
stan@sri-csli.arpa ,
tw@su-csli.arpa
Cc: /users/old/harel/corr%wisdom.bitnet@WISCVM.ARPA ,
barwise@su-csli.arpa ,
vardi%sri-iu@csnet-relay.arpa
please excuse me for butting into this exciting correspondence
within csli, of which i seem to be receiving copies...
i would suggest, if it is ok with you, that you talk to vardi about
my more recent interests, about which i talked about at monterey during
the summer. it is these things + my less recent interests that i
would like to work on and talk to people about during the summer,
if possible.
thanx in advance
david harel
∂03-Mar-85 1732 @SU-CSLI.ARPA:pratt@Navajo Re: Possible-Worlds Semantics for Modal Logic
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 3 Mar 85 17:32:07 PST
Received: from Navajo by SU-CSLI.ARPA with TCP; Sun 3 Mar 85 17:29:05-PST
From: Vaughan Pratt <pratt@Navajo>
Date: 3 Mar 1985 1729-PST (Sunday)
To: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Cc: f1@SU-CSLI.ARPA, f2@SU-CSLI.ARPA, f4@SU-CSLI.ARPA, pratt@SU-AIMVAX.ARPA,
fagin.ibm-sj@CSNET-RELAY.ARPA, halpern.ibm-sj@CSNET-RELAY.ARPA,
kozen%yktvmx.ibm-sj@CSNET-RELAY.ARPA, bboard@SU-CSLI.ARPA,
pratt@Navajo
Subject: Re: Possible-Worlds Semantics for Modal Logic
In-Reply-To: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA> / Fri 22 Feb 85 11:05:20-PST.
(Hmm, looking at the cc list I inherited from your message, Moshe, I note it
includes the CSLI bboard. I had no idea CSLI had the slightest interest
in modal logic, in fact I had formed the distinct impression they felt
they were doing just fine without it. If my impression was wrong then
I'm glad to hear it.)
Some additional perspective on your survey is contributed by the
following paragraph from the lead article, by Bull and Segerberg, in
the recently published second volume of the Handbook of Philosophical
Logic. (Interestingly, the Name Index of this volume includes some 60
computer scientists.)
"All writing of history is to some extent arbitrary. The
historian, in his quest for order, imposes structure. A
favourite strategem is the imposition of n-chotomies. As long as the
arbitrary element is recognized, this procedure seems perfectly
legitimate. This admitted we should like to impose a trichotomy on
early modal logic: modern modal logic derives from three fountain-heads
which may be classified according to their relation to semantics. The
*syntactic* tradition is the oldest and is characterized by the lack of
explicit semantics. Then we have the *algebraic* tradition with a
semantics of sorts in algebraic terms. Finally there is the *model
theoretic* tradition, the youngest one, whose semantics is in terms of
models. Possible worlds semantics is the dominating kind of model
theoretic semantics, perhaps even, if we take advantage of the
vagueness of this term and stretch it a little, the only kind. In the
next few sections we propose to give a brief account of each of the
three traditions."
Which they do very nicely.
Actually the status of the the algebraic "tradition" in modal logic is
somewhat curious, since its historical position relative to what Bull
and Segerberg refer to as the model theoretic tradition is established,
by a single (according to them, cf. Birkhoff, below) paper, the
landmark Jonsson-Tarski paper of 1951, the journal version of a paper
presented at a meeting of the AMS held in November 1947. (Though
Tarski is recently deceased, the current issue of Algebra Universalis
is dedicated to Bjarni Jonsson on the occasion of his 60th birthday.)
The principal result of that paper is that every normal additive
Boolean function can be extended to a completely additive one. Stated
so bluntly (a vicious habit of algebraists), the result at first blush
appears to have only the most tenuous connection with modal logic,
namely that the word "Boolean" appears in its statement.
The connection however is really quite direct. The diamond modality is
of course a Boolean function, since if p is a proposition, so is <>p, that
is, <> maps propositions to propositions, or more abstractly Booleans
to Booleans. Writing []p for ~<>~p, the rule "from p infer []p" and
the axiom "[](p->q) -> ([]p -> []q)" have (in the context of
propositional or Boolean logic) the same content as the two axioms
<>0 = 0 and <>(pvq) = <>p v <>q. But this is the definition of a
normal (or strict) additive function.
Now consider the usual possible-worlds interpretation of <>p, via some
binary relation of accessibility between worlds. Under this
interpretation it is easy to show that <> is a completely additive
function on the Boolean algebra of all sets of possible worlds.
Furthermore any completely additive function on an atomistic Boolean
algebra uniquely determines a binary relation on the atoms which can
serve as the relation of accessibility corresponding to that function.
So we see that the normal additive Boolean functions correspond to
the usual fundamental axioms for <>, while the completely additive
functions correspond to the usual possible-worlds semantics for <>.
Finally, a slight rephrasing of the Jonsson-Tarski theorem completes
the connection: every algebra (B,<>), where B is a Boolean algebra
and <> is a normal additive function on B, is isomorphic to a subalgebra
of (B+,<>+) where B+ is a Boolean algebra and <>+ is a completely
additive function on B+. In other words:
****************************************************************
* if <> is defined axiomatically, it behaves exactly as though *
* it had been defined by a relation of accessibility *
****************************************************************
This correspondence is to completeness of axiom systems for
modal logics as Stone's representation theorem for Boolean algebras
is to completeness of axiom systems for propositional
calculus. In both cases the completeness in question can be made an
immediate corollary of the completeness of equational logic (which in
turn is an immediate corollary of the fact that every equational theory
is a substitutive congruence). Yet in both cases the algebraic result
is far stronger than the easy corollary, since the result remains
relevant as one strengthens one's language, allowing for example
quantification over (abstract) propositions (first-order theory of
Boolean algebras). This is what one gets from an isomorphism
result of this kind - all weaker equivalence relations such as
elementary (first-order) equivalence and equational equivalence are
immediate corollaries.
Given this correspondence it is natural to ask whether modal logicians
should conduct business with additive functions or possible worlds.
In general I would say, use whatever you feel most comfortable with.
In my own case I spent several years using possible-world semantics
before I even found out about additive functions, at which point I
suddenly found my work dramatically simplified.
While I am happy to translate additive functions into accessibility
relations on demand, I no longer have any desire myself to think
about modal logic in terms of possible worlds. If presented with a
problem about possible worlds I translate it into an algebraic problem,
solve it, and if necessary for exposition translate it back into
possible-world semantics. Obviously this strategy can fail,
e.g. on the problem of whether this strategy can fail. However it
works well for a broad class of problems.
It is natural to ask what was on Jonsson and Tarski's collective mind
when they wrote their 1951 paper. Were they aware of the fundamental
contribution made by their paper to modal logic?
The paper neither mentions modal logic nor refers to modal logic papers.
It does however give as applications topology (with the functions of
interest being topological closure operations) and first order logic
(the functions being quantifiers, thought of as projections or
"cylindrifiers").
Interestingly, the Jonsson-Tarski theorem for the special case of the
functions being topological closure operations appears to have been
proved earlier still, by Garrett Birkhoff in 1937 ("Rings of Sets,"
Duke Math. J., 3, 443-454). Since the conditions on being a
topological closure algebra are exactly the axioms for Lewis' modal logic
S4 ([]p -> p, []p -> [][]p), if Jonsson-Tarski are to be credited with
a contribution to modal logic, as implied by Bull and Segerberg (and
other logicians I have spoken with) then it would seem only fair to give
similar, in fact prior, credit to Birkhoff.
Birkhoff's representation theorem applies to S4, the Jonsson-Tarski
result applies to the more general system K. It is straightforward to
apply these representations to more specialized modal logics but not to
less, whence the Jonsson-Tarski result is the more powerful. This
would not however invalidate a claim by Birkhoff to being the first to
prove a result interpretable as a completeness theorem for a modal
logic. Jonsson and Tarski have no stronger claim save in degree.
This priority of Birkhoff for S4 over J&T for K seems to have been
overlooked by the modal logicians. Bull and Segerberg certainly make
no mention of it.
Back to our question. Why did Jonsson and Tarski not mention modal logic
in their paper? There were innumerable modal logic papers in JSL and
elsewhere in the 1940's, all in the "syntactic tradition." In 1944 Tarski
coauthored a paper on "The algebra of topology" with J.C.C. McKinsey, who
himself published extensively on modal logic at around that time.
My guess is that, despite his prior contributions to the algebras of
binary relations (1941), of closure operations (1944 with McKinsey),
and of quantifiers (1948 with Chin), all of which contain aspects of
possible-worlds semantics, Tarski had not seen the possible-worlds
interpretation for modal logic itself! Hence he and Jonsson overlooked
a key application of their result. If so, then this overlooking on
their part, more than anything else, would explain why theorems about
completeness for axioms about possible-world semantics did not appear
until more than a decade later.
I suppose we should write and ask Jonsson.
-v
∂03-Mar-85 1737 RICH%MIT-OZ@MIT-MC.ARPA AAAI Cooperation Policy
Received: from MIT-HTVAX.ARPA by SU-AI.ARPA with TCP; 3 Mar 85 17:37:37 PST
Received: from MIT-OZ by MIT-HTVAX (4.12/4.7) with CHAOS
id AA06249; Sun, 3 Mar 85 20:32:01 est
Date: 3 Mar 1985 20:30 EST (Sun)
Message-Id: <RICH.12092194971.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: ai.woody@MCC.ARPA, Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Engelmore@SUMEX-AIM.ARPA, Fikes@USC-ECL.ARPA,
Genesereth@SUMEX-AIM.ARPA, hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
Lerman@SRI-KL.ARPA, MCdermott@CMU-CS-A.ARPA, PHW@MIT-MC.ARPA,
Reddy@CMU-CS-A.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stan@SRI-AI.ARPA,
Stefik@XEROX.ARPA, tenenbaum@SRI-KL.ARPA
Subject: AAAI Cooperation Policy
In-Reply-To: Msg of 1 Mar 1985 14:41-EST from AAAI <AAAI-OFFICE at SUMEX-AIM.ARPA>
Claudia -
RE Introduction:
In return, the AAAI will allow the cooperating organization to use the
membership mailing list and/or place a display ad in the AI Magazine
announcing the meeting to AAAI members free of charge.
--- How about the use of our logo and good name?
RE Section 3:
a. At least a majority of the Program Committee and/or paper
reviewers must represent the broader interests of the AI community and
should not represent any particular special-interest group.
--- I am not sure what this phrase means or what is the intent.
Sure AI in Medicine is a "special-interest" group. I suggest we flush
this line and just keep the remainder of the paragraph:
The AAAI Conference Committee requests that the composition of the
program committee and/or the paper reviewers be presented to them as a
part of the application (see below for more details about the
application).
Re Section 4:
---- I am not sure we should endorse any other tutorials. What will
be the responsibilities of the AAAI Tutorial Chair in this regard?
What does "facilitate the tutorial organizers mean"? This should be
coordinated with the draft policy on tutorials. If we cooperate on a
meeting, I think it should be clear in the conference materials whether
or not the tutorial are part of our tutorial program or not. I think
we should should be very careful about this issue.
∂03-Mar-85 1919 JJW Common Lisp
To: JMC, RPG
A new version of the TOPS-20 Common Lisp has been installed on Score, and
Len Bosack seems eager to get people to try it. So if you have any tests,
send him results or comments.
∂04-Mar-85 0813 RICH%MIT-OZ@MIT-MC.ARPA Two AAAI Conferences
Received: from MIT-HTVAX.ARPA by SU-AI.ARPA with TCP; 4 Mar 85 08:12:58 PST
Received: from MIT-OZ by MIT-HTVAX (4.12/4.7) with CHAOS
id AA09678; Mon, 4 Mar 85 11:01:36 est
Date: 4 Mar 1985 11:00 EST (Mon)
Message-Id: <RICH.12092353299.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Cc: ai.woody@MCC.ARPA, Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Engelmore@SUMEX-AIM.ARPA, Fikes@USC-ECL.ARPA,
Genesereth@SUMEX-AIM.ARPA, hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
Lerman@SRI-KL.ARPA, MCdermott@CMU-CS-A.ARPA, PHW@MIT-MC.ARPA,
Reddy@CMU-CS-A.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stan@SRI-AI.ARPA,
Stefik@XEROX.ARPA, tenenbaum@SRI-KL.ARPA, rich%MIT-OZ@MIT-MC.ARPA
Subject: Two AAAI Conferences
In-Reply-To: Msg of 1 Mar 1985 14:41-EST from AAAI <AAAI-OFFICE at SUMEX-AIM.ARPA>
Although I concur with the problem this proposal is trying to address,
I am uncomfortable with the proposed solution. I need to think and
talk to people a little more to help me articulate my dislike of the
present suggestion and come up with an alternative. In the meantime,
I would just like to register my negative reaction, and bring up
a few questions:
What are the underlying assumptions of the proposal? Are there really
two distinct communities ("them" and "us") ? Would most of us want to
go to both conferences? (I would like to see the exhibits). Will
this have the effect of pushing basic research even farther into the
background?
As an alternative, my thoughts run in the direction of trying to
carefully restructure the current conference so as to serve multiple
needs.
-Chuck.
∂04-Mar-85 0900 JMC*
Jim Adams
∂04-Mar-85 0900 JMC*
Campbell secretary
∂04-Mar-85 0948 NILSSON@SU-SCORE.ARPA Tom
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Mar 85 09:47:56 PST
Date: Mon 4 Mar 85 09:32:18-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Tom
To: Cannon@SU-SIERRA.ARPA, jmc@SU-AI.ARPA, reynolds@SU-SCORE.ARPA
cc: nilsson@SU-SCORE.ARPA
I've talked with Tom Binford. I think he will show up at
tomorrow's meeting (remember tomorrow's meeting?) There is
a good chance Tom will see that stepping aside to pursue
his own research as a member of the newly led team is what
he really wants to do anyway. We had a very explicit discussion.
-Nils
-------
∂04-Mar-85 1017 AAAI-OFFICE@SUMEX-AIM.ARPA List of Councilors
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Mar 85 10:17:22 PST
Date: Mon 4 Mar 85 10:14:45-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: List of Councilors
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I thought I had sent you the list of current and former members. Well, here
is that list.
Claudia
Woody Bledsoe ai.woody@mcc President 84-85
MCC
9430 Research Blvd
Austin, TX 78767
Ron Brachman brachman@sri-kl Councilor 84-87
Sclumberger-CAS Research
3340 Hillview
Palo Alto, CA 94304
Bruce G. Buchanan 415:497-0935 membership 79-
Computer Science Department 321-2561 home councilor 79-81
Stanford University buchanan@sumex
Stanford, CA 94305
Eugene Charniak councilor 83-6
Computer Science Department
Brown University
Providence, RI 02912
Randall Davis councilor 83-6
MIT-AI Laboratory Tutorial Chair
545 Technology Square krd@mit-mc '85
Cambridge, MA 02139
Robert Engelmore 415:327-6600 editor AI Mag 81-
Teknowledge
525 University Avenue bengelmore@sri-kl
Palo Alto, CA 94301
Lee D. Erman 415:327-6600 publications 79-
Teknowledge, Inc. councilor 79-80
525 University Avenue lerman@sri-kl
Palo Alto, CA 94301
Michael R. Genesereth 415:497-0324 councilor 82-5
Computer Science Department program 83
Stanford University csd.genesereth@score
Stanford, CA 94305
Peter E. Hart 415:325-9339 councilor 82-5
Syntelligence
1000 Hamlin hart@sri-kl
Sunnyvale, CA
John McCarthy 415:497-4430 president 83-4
Computer Science Department councilor 80-2
Stanford University jmc@su-ai
Stanford, CA 94305
John McDermott mcdermott@cmu-cs-a Councilor 84-87
Computer Science Dept
Carnegie-Mellon University
Pittsburgh, PA 15213
D. Raj Reddy 412:578-2597 councilor 79-81 82-5
Computer Science Department 683-8779 home finance 80-
Carnegie-Mellon University reddy@cmua
Pittsburgh, PA 15213
Charles Rich rich@mit-mc councilor 84-87
MIT AI Lab
545 Technology Sq
Cambridge, MA 02139
Stanley J. Rosenschein 415:859-4167 councilor 82-3 83-6
Artificial Intelligence Center
SRI International stan@sri-ai
Menlo Park, CA 94025
Edward Shortiffe, TC117 Shortliffe@sumex Councilor 84-87
Stanford Medical Center
Stanford, CA 94305
Mark Stefik councilor 83-6
Xerox PARC
3333 Coyote Hill Road stefik@parc
Palo Alto, CA 94304
Jay M. Tenenbaum 415:496-4699 conference 80-
Sclumberger-CAS Research Tenenbaum@sri-kl
3340 Hillview St.
Palo Alto, CA 94304
Patrick H. Winston 617:253-6218 councilor 79-81
MIT-AI Laboratory President 85-
545 Technology Square phw@mit-mc President-elect
Cambridge, MA 02139 84-85
! FORMER AAAI OFFICIALS
Robert M. Balzer 213-822-1511 program 80
USC/ISI
4676 Admiralty Way balzer@isif
Marina del Rey, CA 90291
Daniel G. Bobrow 415:494-4438 councilor 80-83
Xerox PARC
3333 Coyote Hill Road bobrow@parc
Palo Alto, CA 94304
Scott Fahlman 412:578-2575 local 1982
Computer Science Department
Carnegie-Mellon University fahlman@cmuc
Pittsburgh, PA 15213
Edward A. Feigenbaum 415:497-4079 president 80-1
Computer Science Department 493-5618 home
Stanford University feigenbaum@sumex
Stanford, CA 94305
Jerome A. Feldman 716:275-5478 councilor 80-2
Computer Science Department
University of Rochester feldman@sumex
Rochester, NY 14627
Barbara J. Grosz 415:859-4839 councilor 81-4
Artificial Intelligence Center
SRI International grosz@sri-ai
Menlo Park, CA 94025
Frederick Hayes-Roth 415:327-6600 tutorials 80 81
Teknowledge
525 University Avenue rhayes-roth@sri-kl
Palo Alto, CA 94301
Douglas Lenat tutorial 84
Computer Science Department
Stanford University
Stanford, CA 94305
Drew McDermott 203:436-4771 councilor 80-83
Computer Science Department
Yale University mcdermott@yale
New Haven, CT 06520
Marvin Minsky 617:253-5864 president 81-2
MIT-AI Laboratory councilor 80-1
545 Technology Square minsky@mit-mc
Cambridge, MA 02139
Nils J. Nilsson 415:859-7735 president 82-3
Artificial Intelligence Center 854-5265 home councilor 79-1
SRI International nilsson@sri-ai
Menlo Park, CA 94025
Allen Newell 412:578-2602 president 79-80
Computer Science Department 421-3668 home
Carnegie-Mellon University newell@cmua
Pittsburgh, PA 15213
Charles Rich 617-253-7877 tutorials 82 83
MIT AI Laboratory, Rm 342 643-7465 home and Councilor 84-87
545 Technology Square rich@mit-ai
Cambridge, MA 02139
Charles J. Rieger 703:476-6100 councilor 81-4
Scion
12310 Pinecrest Road
Reston, VA 22091
Earl D. Sacerdoti 408:737-7960 councilor 79-81
Machine Intelligence 415:325-4119 home
330 Potrero Avenue sacerdoti@sri-kl
Sunnyvale, CA 94086
Herbert A. Simon 412:578-2787 councilor 80-2
Department of Psychology
Carnegie-Mellon University simon@cmua
Pittsburgh, PA 15213
Gerald J. Sussman 617:253-5874 councilor 81-4
MIT AI Laboratory
545 Technology Square gjs@mit-ai
Cambridge, MA 02139 (CAL Tech now?)
Alan M. Thompson editor AI Mag 80-1
Donald E. Walker 201-582-7406 sec-treas 79-83
Bell Communications Research
435 South St.
Morristown, NJ 07960
David L. Waltz 217:333-6071 councilor 79-80 81-3
Thinking Machines Inc. program 82
Walham, MA
Bonnie L. Webber 215:243-7745 councilor 81-4
Computer & Information Science
University of Pennsylvania bonnie.upenn@udel
Philadelphia, PA 15213
Terry Winograd 415:497-2273 councilor 80-1
Computer Science Department
Stanford University tw@su-ai
Stanford, CA 94305 winograd@parc
William A. Woods 617:497-3361 councilor 81-2
Applied Expert Systems
5 Cambridge Ctr. woods@bbng
Cambridge, MA 02142
-------
∂04-Mar-85 1051 VARDI@SU-CSLI.ARPA Modal Logic
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Mar 85 10:51:24 PST
Date: Mon 4 Mar 85 10:48:11-PST
From: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Subject: Modal Logic
To: pratt@SU-NAVAJO.ARPA
cc: finterest@SU-CSLI.ARPA, halpern.ibm-sj@CSNET-RELAY.ARPA,
fagin.ibm-sj@CSNET-RELAY.ARPA
Thanks for your enlightening message. In partiocular I was surprised to hear
about Birkhoffs contribution. I'd like to make two points.
1. I am puzzled by the fact that Lemmon didn't reference Tarski+Jonsson at
all. More so, since Kripke reference them. On the other hand, dynamic
logician consistently ignore modal logician. So I shouldn't be surprised
that modal logicians ignore algebraists.
2. It is possible that algebraic semantics is technically superior to
possible worlds semantics. But it is completely unsatisfying philosophically.
This is why modal logic started blooming after the introduction of possible
worlds semantics in the late 50s. Furthermore, I'd like to see you do
algebraic semantics for 1st-order modal logic!
Moshe
-------
∂04-Mar-85 1322 Stefik.pa@Xerox.ARPA Re: Two Recommendations from the Conference Committee
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 4 Mar 85 13:21:52 PST
Received: from Semillon.ms by ArpaGateway.ms ; 04 MAR 85 13:13:43 PST
Date: 4 Mar 85 13:13 PST
From: Stefik.pa@XEROX.ARPA
Subject: Re: Two Recommendations from the Conference Committee
In-reply-to: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>'s message of Fri, 1 Mar
85 11:41:13 PST
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, JMC@SU-AI.ARPA,
MCdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA,
Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stefik.PA@XEROX.ARPA,
tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA
Here are a few comments on the proposed policies. I'd like
clarification on some of the points for the collaboration with other
societies. I do not favor the two conference proposal and offer a
counter proposal below.
------------
Collaboration
I miss a statement of purpose re sponsorship. We are certainly
providing a lot of hoops for other societies to jump though. We need to
set up some bureacracy to make it work and to review proposals. Why
bother?
3. Review Standards
What does it mean for "a majority of the Program Committee ... to
represent the broader interests of the AI community ..and not any
particular special-interest group?" Is not the AMA example a special
interest group?
------------
Two Conferences per year.
I'm concerned that if the Applications and Technology conference is
thought of just as the "AAAI cashcow", then senior leadership of AAAI
will pay no attention to it and it may become as bad as the IEEE
conferences. This is especially true if it is just a tradeshow +
tutorials + loosely-reviewed papers.
If the applications conference becomes too "second class", the crowds
may want to come to the scientific conference anyway.
COUNTER PROPOSAL
I'd rather see the two conferences back to back, with separate
registration. Applications is Sunday - Wed. Science conference is Wed
- Sat. For example:
--------------------
Sunday: Trade Show. Tutorials. Workshops. Applications.
Monday: Ditto.
Tuesday: Ditto.
Wednesday. Invited Lectures. Awards. Presidential address. Trade
show. Gala Dinner event.
------ close the trade show. (Turn off the hoopla.)
Thursday: Scientific Sessions.
Friday: Scientific Sessions.
Saturday: Scientific Sessions.
---------
This would allow us to schedule "science" workshops to overlap with the
applications conference and would enable people to see the trade show.
Most of the recruiters will be most interested in the applications
papers. I think that it also allows enough time for the science
sessions and would save travel time for people who have some interests
in both conferences.
∂04-Mar-85 1400 JMC*
pony 7.15
∂04-Mar-85 1612 RA picture-taking time
Carolyn Caddes said she'd be here tomorrow at 2:15 to set
things up so that when you come in at 2:35 she'll be ready
to take your picture.
∂04-Mar-85 1652 RA Suppes
Pat Suppes called you. Please call him 7-3111.
∂04-Mar-85 1658 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Mar 85 16:58:01 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 4 Mar 85 16:55:20-PST
Date: Mon 4 Mar 85 16:55:26-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
The next F4 meeting will be held on March 18 at 1:15 in the Ventura
Conference Room. We will continue discussing Dick Jeffrey's paper,
concentrating on the final section, "Psychology and Probablity Logic."
-------
∂05-Mar-85 0703 AMAREL@RUTGERS.ARPA Re: Two Recommendations from the Conference Committee
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 07:03:42 PST
Date: 5 Mar 85 09:58:34 EST
From: AMAREL@RUTGERS.ARPA
Subject: Re: Two Recommendations from the Conference Committee
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA, Brachman@SRI-KL.ARPA,
Davis%MIT-OZ@MIT-XX.ARPA, Genesereth@SUMEX-AIM.ARPA,
Buchanan@SUMEX-AIM.ARPA, Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA,
JMC@SU-AI.ARPA, MCdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA,
Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Stefik@XEROX.ARPA, tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA,
AMAREL@RUTGERS.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of 1 Mar 85 14:41:13 EST
πHere are some general comments on the proposed policies.
On cooperation with other organizations: I am assuming that the
purpose is to set conditions for AAAI endorsement/sponsorship
of meetings by other organizations; the conditions are designed
to minimize conflict with goals and plans of AAAI. I find the
conditions too strict. Decisions on sponsorship are based on
more informal mutual understanding and exchange of information.
If in doubt, don't sponsor.
On two conferences: I don't think it is a good idea. It is too
early to draw a line between research and applications. The
field will continue to benefit by interactions between these
two types of activities. I suggest that we look into the experience
of several Engineering Societies and Psychology, where Natl
Conferences accomodate all activities/components of a discipline
by distributing them in some judicious way over several days
of a single mtg. A single mtg will have a good influence on
standards of applications papers. The experience of IJCAI in
handling various types of papers can be useful here. Also, I
expect that, in time, many 'AI applications' papers will be
presented at conferences of 'consuming disciplines' (engineering,
medicine, economics, etc), and it is appropriate for these
disciplines to set standards for papers that claim to make
contributions to them.
Regards, Saul
-------
∂05-Mar-85 0902 @SRI-AI.ARPA:stefik.pa@Xerox.ARPA Re: Term of the Chairs and the Secretary-Treasurer
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 09:02:41 PST
Received: from Xerox.ARPA by SRI-AI.ARPA with TCP; Tue 5 Mar 85 09:00:54-PST
Received: from Semillon.ms by ArpaGateway.ms ; 05 MAR 85 08:52:03 PST
Date: 5 Mar 85 08:51 PST
From: stefik.pa@XEROX.ARPA
Subject: Re: Term of the Chairs and the Secretary-Treasurer
In-reply-to: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>'s message of Tue, 26 Feb
85 09:58:53 PST
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Brachman@SRI-KL.ARPA,
Charniak-brown@CSNET-RELAY.ARPA, KRD@MIT-MC.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SRI-AI.ARPA,
McDermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA,
Fikes@USC-ECL.ARPA, stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Tenenbaum@SRI-AI.ARPA, Buchanan@SUMEX-AIM.ARPA, Winston@MIT-MC.ARPA,
Stefik.PA@XEROX.ARPA
It's hard enough to find capable people willing to serve on these
committees. I see no advantage to limiting the term. People will quit
when they are tired of it (and may want to agree informally about term
with the President when they sign up.) If someone is incompetent at a
position, the council ought to ease them out of the position whether the
term is over or not.
I advise keeping it flexible, as it is. Mark
∂05-Mar-85 0949 FEIGENBAUM@SUMEX-AIM.ARPA need for meeting TODAY (unfortunately)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 09:49:33 PST
Date: Tue 5 Mar 85 09:35:22-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: need for meeting TODAY (unfortunately)
To: jmc@SU-AI.ARPA, rpg@SU-AI.ARPA, rindfleisch@SUMEX-AIM.ARPA,
delagi@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA, nii@SUMEX-AIM.ARPA
Please excuse the request for a meeting on such short notice. I have to
be out of town for most of the remaiinder of the week before the dinner
with Bob Kahn, and wanted to participate in a session in which we
"mutually exchanged and adjusted" our views re the two machines
(Sequent and copy-of-Arvind-emulator) so as to have a coherent and sensible
set of things to say to Bob Kahn.
I propose 12-1 in the Welch Road Conference Room, on the theory that since
it's lunchtime anywy, and three of us need miss only the faculty lunch
to attend, perhaps that's the best time.
Other available time is 3-4pm.
RSVP ASAP
Ed
-------
∂05-Mar-85 0951 NII@SUMEX-AIM.ARPA Re: need for meeting TODAY (unfortunately)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 09:51:14 PST
Date: Tue 5 Mar 85 09:41:11-PST
From: Penny Nii <NII@SUMEX-AIM.ARPA>
Subject: Re: need for meeting TODAY (unfortunately)
To: FEIGENBAUM@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA, rpg@SU-AI.ARPA, rindfleisch@SUMEX-AIM.ARPA,
delagi@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA, NII@SUMEX-AIM.ARPA
In-Reply-To: Message from "Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>" of Tue 5 Mar 85 09:36:01-PST
any time is fine...penny
-------
∂05-Mar-85 1045 RPG Meeting
To: FEIGENBAUM@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
rindfleisch@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA,
brown@SUMEX-AIM.ARPA, NII@SUMEX-AIM.ARPA
I can make it either time, but you should call me if it is to be at 12.
424-8855.
-rpg-
∂05-Mar-85 1242 JJW Lisp Machine disk
To: JMC@SU-AI.ARPA
CC: Bosack@SU-SCORE.ARPA
Jock Mackinlay and I discussed the need for more disk space on the Symbolics
3600s, and decided that we really need a Fujitsu Eagle on one of them (both,
if we can afford it). Adding Macsyma used up most of the available space,
and the next release of the Symbolics system will not fit because it
includes all the documentation on line.
According to Len, such a disk costs cost $7000 if purchased from Fujitsu,
and there should be money in the ARPA grant that bought the machines that
could be used. If we agree on buying one, let's do it as soon as possible
since the Symbolics code should arrive sometime in April. If the paperwork
will take too long, maybe we can borrow one from another computer for a few
months.
∂05-Mar-85 1310 FFL Next Robotics Search Committee meeting
To: JMC, FFL
Robotics Search Committee meeting will be held March 21, 2 p.m., Chairman's
Conference Room.
∂05-Mar-85 1344 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 13:44:04 PST
Date: Tue 5 Mar 85 13:43:02-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Hello,
Dr. Vladimar Bukovsky called about a dinner tonight. Ph 326-9694 (home)
Kim
-------
∂05-Mar-85 1408 RA Mike Magill
Please call him (56) 298 8114, re: problems with main sail.
∂05-Mar-85 1512 BUCHANAN@SUMEX-AIM.ARPA Joseph Edozien
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 15:12:33 PST
Date: Tue 5 Mar 85 14:58:12-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Joseph Edozien
To: jmc@SU-AI.ARPA
cc: cheadle@SU-SCORE.ARPA, bgb@SUMEX-AIM.ARPA
John,
Edozien has requested reinstatement to the MSAI program after dropping
out for financial & personal reasons. ON the form he indicates he will
be working with you. Have you agreed to supervise him? Will you support
him also?
bgb
-------
∂05-Mar-85 1612 Tenenbaum@SRI-KL.ARPA Re: Two AAAI Conferences
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 16:12:19 PST
Date: Tue 5 Mar 85 14:55:37-PST
From: Marty Tenenbaum <Tenenbaum@SRI-KL>
Subject: Re: Two AAAI Conferences
To: RICH%MIT-OZ%MIT-MC@SRI-KL
cc: AAAI-OFFICE%SUMEX-AIM@SRI-KL, ai.woody%MCC@SRI-KL, Amarel%RUTGERS@SRI-KL,
Brachman@SRI-KL, Buchanan%SUMEX-AIM@SRI-KL, Davis%MIT-OZ%MIT-XX@SRI-KL,
Engelmore%SUMEX-AIM@SRI-KL, Fikes%USC-ECL@SRI-KL,
Genesereth%SUMEX-AIM@SRI-KL, hart%SRI-AI@SRI-KL, JMC%SU-AI@SRI-KL,
Lerman%SRI-KL@SRI-KL, MCdermott%CMU-CS-A@SRI-KL, PHW%MIT-MC@SRI-KL,
Reddy%CMU-CS-A@SRI-KL, Shortliffe%SUMEX-AIM@SRI-KL, Stan%SRI-AI@SRI-KL,
Stefik%Xerox@SRI-KL
In-Reply-To: Message from "Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>" of Mon 4 Mar 85 11:00:00-PST
Chuck,
We (the conference committee) believe that there are several distinct
constituencies within the AI community, and that it is very difficult
to serve all of them effectively through a single conference. The ACM
and IEEE have certainly reached similar conclusions in the fields of
computer science and electrical engineering respectively.
I agree with you that many researchers would also want to attend the
technology conference. Most applications people, however, probably would
not want to attend the research conference.
Regarding restructuring the present conference, I would like the
technology conference to include the best seminal papers from the
research conference and perhaps, vice versa. That way, people
could opt to attend one or the other, without fear of missing
something crucial.
We welcome you further thoughts when they crystalize.
JMT.
-------
∂05-Mar-85 1626 Tenenbaum@SRI-KL.ARPA Re: Two Recommendations from the Conference Committee
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 16:26:15 PST
Date: Tue 5 Mar 85 15:48:41-PST
From: Marty Tenenbaum <Tenenbaum@SRI-KL>
Subject: Re: Two Recommendations from the Conference Committee
To: Stefik.pa%Xerox@SRI-KL
cc: AAAI-OFFICE%SUMEX-AIM@SRI-KL, Amarel%RUTGERS@SRI-KL, ai.woody%MCC@SRI-KL,
Fikes%USC-ECL@SRI-KL, Brachman@SRI-KL, Davis%MIT-OZ%MIT-XX@SRI-KL,
Genesereth%SUMEX-AIM@SRI-KL, Buchanan%SUMEX-AIM@SRI-KL,
Engelmore%SUMEX-AIM@SRI-KL, Lerman%SRI-KL@SRI-KL, JMC%SU-AI@SRI-KL,
MCdermott%CMU-CS-A@SRI-KL, Reddy%CMU-CS-A@SRI-KL, Rich%MIT-MC@SRI-KL,
Stan%SRI-AI@SRI-KL, Shortliffe%SUMEX-AIM@SRI-KL, PHW%MIT-MC@SRI-KL,
hart%SRI-AI@SRI-KL
In-Reply-To: Message from "Stefik.pa@XEROX.ARPA" of Mon 4 Mar 85 13:13:00-PST
Mark, some responses to your thoughtful comments.
I miss a statement of purpose re sponsorship. We are certainly
providing a lot of hoops for other societies to jump though. We need to
set up some bureacracy to make it work and to review proposals. Why
bother?
A statement of purpose is indeed needed. Why bother:
because our hoops help ensure the quality and integrity of the events
we sponsor. This is our responsibility as the premier
technical and professional society concerned with AI. One concrete
benefit I envision is the role of sponsored events as filters to
help select seminal papers for presentation at our national conferences.
3. Review Standards
What does it mean for "a majority of the Program Committee ... to
represent the broader interests of the AI community ..and not any
particular special-interest group?" Is not the AMA example a special
interest group?
The point here is to support events that benefit the field as
a whole (as opposed to, say, a particular commercial organization
or one side of a contentious technical issue). Perhaps we can word
this better.
------------
Two Conferences per year.
I'm concerned that if the Applications and Technology conference is
thought of just as the "AAAI cashcow", then senior leadership of AAAI
will pay no attention to it and it may become as bad as the IEEE
conferences. This is especially true if it is just a tradeshow +
tutorials + loosely-reviewed papers.
If the applications conference becomes too "second class", the crowds
may want to come to the scientific conference anyway.
Where is it implied that the technology conference is intended as
just a "cash cow" or is to be second rate and loosely refereed?
COUNTER PROPOSAL
I'd rather see the two conferences back to back, with separate
registration. Applications is Sunday - Wed. Science conference is Wed
- Sat. For example:
--------------------
Sunday: Trade Show. Tutorials. Workshops. Applications.
Monday: Ditto.
Tuesday: Ditto.
Wednesday. Invited Lectures. Awards. Presidential address. Trade
show. Gala Dinner event.
------ close the trade show. (Turn off the hoopla.)
Thursday: Scientific Sessions.
Friday: Scientific Sessions.
Saturday: Scientific Sessions.
---------
This would allow us to schedule "science" workshops to overlap with the
applications conference and would enable people to see the trade show.
Most of the recruiters will be most interested in the applications
papers. I think that it also allows enough time for the science
sessions and would save travel time for people who have some interests
Your proposal is an interesting alternative to two conferences,
addressing many of the original motivations. It deserves
serious consideration. The principal shortcoming I
see is that we would like to keep the research conference as small and as
academic as possible. Towards this end, we want to hold it
on a university campus, not at a conference center. Also, if
the conferences were temporally adjacent, too many
non-researchers would just "hang around" for an extra few days.
JMT.
-------
∂05-Mar-85 1632 BSCOTT@SU-SCORE.ARPA Final Report
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 16:32:08 PST
Date: Tue 5 Mar 85 16:27:48-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Final Report
To: JMC@SU-AI.ARPA
cc: RA@SU-AI.ARPA, BScott@SU-SCORE.ARPA
John,
The Final Project Report on your Basic AI NSF which ended 12/31/84 will be
due by the end of March. I will give the Final Report Form to Rutie.
Betty
-------
∂05-Mar-85 1727 NILSSON@SU-SCORE.ARPA Brady Visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 17:27:24 PST
Date: Tue 5 Mar 85 17:26:38-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Brady Visit
To: cannon@SU-SIERRA.ARPA, jmc@SU-AI.ARPA, reynolds@SU-SCORE.ARPA,
tob@SU-AI.ARPA, bscott@SU-SCORE.ARPA
cc: nilsson@SU-SCORE.ARPA
Mike Brady, a prime robotics candidate, proposes that he visit Stanford
on Thursday, March 21. Is that date ok with everyone? We can arrange
for him to give a 4:15 seminar, have him talk to our committee for
a while and also have him talk to other faculty members as interested.
I told him I would answer him tomorrow (Wednesday) regarding suitability
of that date. -Nils
-------
∂05-Mar-85 1838 Tenenbaum@SRI-KL.ARPA Re: Two Recommendations from the Conference Committee
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 18:38:10 PST
Date: Tue 5 Mar 85 16:01:11-PST
From: Marty Tenenbaum <Tenenbaum@SRI-KL>
Subject: Re: Two Recommendations from the Conference Committee
To: AMAREL%RUTGERS@SRI-KL
cc: AAAI-OFFICE%SUMEX-AIM@SRI-KL, ai.woody%MCC@SRI-KL, Fikes%USC-ECL@SRI-KL,
Brachman@SRI-KL, Davis%MIT-OZ%MIT-XX@SRI-KL, Genesereth%SUMEX-AIM@SRI-KL,
Buchanan%SUMEX-AIM@SRI-KL, Engelmore%SUMEX-AIM@SRI-KL,
Lerman%SRI-KL@SRI-KL, JMC%SU-AI@SRI-KL, MCdermott%CMU-CS-A@SRI-KL,
Reddy%CMU-CS-A@SRI-KL, Rich%MIT-MC@SRI-KL, Stan%SRI-AI@SRI-KL,
Shortliffe%SUMEX-AIM@SRI-KL, Stefik%Xerox@SRI-KL, PHW%MIT-MC@SRI-KL,
hart%SRI-AI@SRI-KL
In-Reply-To: Message from "AMAREL@RUTGERS.ARPA" of Tue 5 Mar 85 09:58:34-PST
Saul's point that applications papers will increasingly be presented
at "disciplinary" conferences is a good one. It wasnt explicitly
considered when we drew up our proposal. I beleive, however, that
there are substantial commonalities of technology across domains (at
the level of diagnosis, configuration etc.) that justify AAAI
conferences on AI technology. A natural question that then arises is
whether the papers should be organized by application domain or by
generic category.
-------
∂05-Mar-85 1927 @SU-CSLI.ARPA:pratt@Navajo Re: Modal Logic
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Mar 85 19:26:51 PST
Received: from Navajo by SU-CSLI.ARPA with TCP; Tue 5 Mar 85 19:24:04-PST
From: Vaughan Pratt <pratt@Navajo>
Date: 5 Mar 1985 1924-PST (Tuesday)
To: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Cc: finterest@SU-CSLI.ARPA, halpern.ibm-sj@CSNET-RELAY.ARPA,
fagin.ibm-sj@CSNET-RELAY.ARPA, pratt@Navajo
Subject: Re: Modal Logic
In-Reply-To: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA> / Mon 4 Mar 85 10:48:11-PST.
I don't understand what is "philosophically unsatisfying" about using
additive functions on Boolean elements in place of binary relations
on possible worlds. Do you find it philosophically unsatisfying to
treat water in units of volume when you know that water is really
made up of atoms?
Sometimes you want to look at an atom, sometimes at a volume. It is
important to be able to move freely between the two.
The same holds for first order logic. Let us consider two applications of
FOL: 1DL and relational databases. In 1DL the atoms are machine states.
A space filled with machine states is to me just a predicate on states,
or if you like, a "fuzzy" state. In relational databases an atom is a record.
A space filled with records is a predicate on records, or a fuzzy record.
It is natural to form Boolean combinations of such volumes/spaces/predicates,
i.e. they form Boolean elements. The action of a modality on such objects
is the action of an additive Boolean function.
What do you find "philosophically unsatisfying" about all this?
-v
∂05-Mar-85 2116 JJW Summer plans
I've told IDA that I can't spend the whole summer there, but suggested
working there for one month instead. (What they're doing this summer
interests me enough that I would really regret not having some chance to
work on it.) The best month for this would be the last week in June and
the first 3 weeks in July.
For the remainder of the summer I would like to have some part-time
support; the Hertz fellowship only covers the 9-month academic year. The
sources that I can think of for this are: a reasearch assistantship, if
that is available; the S-1 project; or consulting for Lucid. Jussi has
already asked me to consult for them part time during the year, but I
turned that down. I don't know if his offer still stands.
∂06-Mar-85 0847 LOUNGO@RUTGERS.ARPA January 1985 Mailing
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 6 Mar 85 08:47:45 PST
Date: 6 Mar 85 11:43:14 EST
From: LOUNGO@RUTGERS.ARPA
Subject: January 1985 Mailing
To: arpanet.mail: ;
cc: LOUNGO@RUTGERS.ARPA, PETTY@RUTGERS.ARPA
Below is a list of our newest technical reports.
The abstracts for these are available for access via FTP with user account
<anonymous> with any password. The file name is:
<library>tecrpts-online.doc
If you wish to order copies of any of these reports please send mail via the
ARPANET to PETTY@RUTGERS or LOUNGO@RUTGERS. Thank you!!
[ ] CBM-TR-139 "LOCALIZATION PROBLEMS AND EXPERT SYSTEMS", Allen Ginsberg.
[ ] CBM-TR-145 (THESIS) (If you wish to order this thesis, a pre-payment
of $15.00 is required). "SHIFT OF BIAS FOR INDUCTIVE
CONCEPT LEARNING", Paul E. Utgoff.
[ ] DCS-TR-149 "ALGORITHMS AND COMPLEXITY FOR A STATISTICAL PROBLEM.
MINIMUM MEDIAN RESIDUAL FITTING", J.M. Steele and W.L.
Steiger.
[ ] DCS-TR-150 "MODULAR VERIFICATION OF COMMUNICATING SEQUENTIAL
PROCESSES", E.A. Akkoyunlu and R.M. Nemes.
[ ] LCSR-TR-60 "ARTIFICIAL INTELLIGENCE AND THE SOCIAL SCIENCES: A
PRELIMINARY REPORT", Saul Amarel.
[ ] LCSR-TR-61 "KNOWLEDGE REPRESENTATION AS THE BASIS FOR REQUIREMENTS",
A. Borgida, S. Greenspan and J. Mylopoulos.
[ ] LCSR-TR-62 "INTRODUCTION TO THE COMTEX MICROFICHE EDITION OF THE
RUTGERS UNIVERSITY ARTIFICIAL INTELLIGENCE RESEARCH REPORTS
(The History of AI at Rutgers)", S. Amarel.
[ ] LCSR-TR-63 "CONTROLLING THE EVOLUTION OF LARGE SCALE SOFTWARE
SYSTEMS", N.H. Minsky.
[ ] LCSR-TR-64 "LEAP: A LEARNING APPRENTICE FOR VLSI DESIGN", T.M.
Mitchell, S. Mahadevan and L.I. Steinberg.
[ ] LCSR-TR-65 "A KNOWLEDGE-BASED APPROACH TO DESIGN", T.M. Mitchell,
L.I. Steinberg, and J.S. Shulman.
[ ] LCSR-TR-66 "VERIFICATION-BASED LEARNING: A GENERALIZATION STRATEGY FOR
INFERRING PROBLEM-DECOMPOSITION METHODS", S. Mahadevan
-------
∂06-Mar-85 1207 RTC Job Reference
Would it be OK for me to give your name on an application for a summer
job?
Ross
∂06-Mar-85 1347 AAAI-OFFICE@SUMEX-AIM.ARPA Minutes from the 1984 Publication Committee Meeting
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 Mar 85 13:47:32 PST
Date: Wed 6 Mar 85 13:38:02-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Minutes from the 1984 Publication Committee Meeting
To: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA,
Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA, mcdermott@CMU-CS-A.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA,
Fikes@USC-ECL.ARPA, PHW@MIT-MC.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I'm forwarding the minutes from Publication Committee meeting. If you have
comments, please forward them to me. Thanks, Claudia
AAAI Publication Committee
Minutes of meeting of 8-Aug-84
Submitted by Lee Erman (chair), 19-Jan-85
The meeting took place at the Villa Capri Motel, in Austin, Texas, during the
AAAI annual conference.
Present during some or all of the meeting:
Danny Bobrow, Jon Doyle, Bob Engelmore, Lee Erman, Claudia Mazzetti,
John McCarthy, Nils Nilsson
MAGAZINE COPYRIGHTS:
We currently do not copyright individual articles, except in a few
cases where the author has requested it.
RESOLVED: The AAAI should take active steps to (1) obtain and hold
the copyrights to each article, (2) give the author free use of the material,
and (3) allow the author to restrict non-AAAI uses. Authors will need to be
notified up-front about this policy.
CONFERENCE PROCEEDINGS COPYRIGHTS:
RESOLVED: Handle in way similar to Magazine.
(NOTE: At the AAAI Executive Committee meeting in the evening of
8-Aug, a motion was moved and carried that the abstracts of Conference papers
be placed in the public domain.)
MAGAZINE ADVERTISING:
Should there be a limit on the amount of advertising accepted for the
AI Mag? How much? If oversubscribed, how to select among advertisers?
Should advertising be intermixed with articles or segregated? How to deal
with preferred locations (such as the covers)?
RESOLVED: The editor has authority to create and modify these
policies; the committee is willing to provide advice.
Engelmore suggested a 25% maximum (by space); the committee felt that
was reasonable. There was general sentiment for segregating the
advertisements from articles.
Suggestion by Bobrow: Put table of contents on outside of the
magazine (perhaps the back) to make it easier to find articles when searching
through back issues.
HONORARIA FOR SOLICITED AI MAGAZINE ARTICLES:
We have occasinally offered honoraria for solicited articles,
especially for surveys.
SENSE: Up to the editor. If it works, do it.
"PRODUCT" ARTICLES IN THE AI MAGAZINE:
Engelmore has occasionally published articles/notices that include
substantial amounts of product descriptions. In most cases, to avoid any
conflict of interest, he has used a disinterested party to judge the redeeming
virtues of such pieces.
SENSE: Engelmore should continue this policy of including such a
piece if worthwhile.
AI MAGAZINE COPY EDITS:
There have been some incidents of changes to articles without approval
of the author. The editor is declaring a policy that this is not to occur.
As a major part of implementing this, he is instituting a procedure whereby
authors are sent galleys with a fast turnaround requirement for any changes.
REPRINT SERVICE:
AAAI has been approached by several organizations interested in
obtaining the right to publish the abstracts from the Conference Proceedings,
and to reprint Conference papers (on request).
SENSE: Not clear this will be much of an advantage to AAAI and to the
field. There may be some interaction with the Kaufman agreement for
publishing and distributing the Proceedings (which is to be renegotiated by
the Secretary/Treasurer).
OLD CONFERENCE PROCEEDINGS:
SENSE: Do not let them go out of print and become unavailable.
-------
∂06-Mar-85 1440 RA insurance form
Dr. Bartlett office (326 1400) called re: insurance form for
estimate for work which needs to be done.
∂06-Mar-85 1739 NILSSON@SU-SCORE.ARPA Brady Visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Mar 85 17:39:08 PST
Date: Wed 6 Mar 85 17:33:00-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Brady Visit
To: jmc@SU-AI.ARPA, reynolds@SU-SCORE.ARPA, cannon@SU-SIERRA.ARPA,
tob@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
Hearing no objections to my proposal to invite Mike Brady to
visit us on Thursday Mar 21, I plan to do so tomorrow. Fran
will attempt to arrange a schedule for him. I'll host him
for lunch at the faculty club, and Fran will ask around to
see who else wants to go to lunch.
Marc Raibert wants to come on Thursday Mar 28 (saying, Bob, that
he has already seen you several times and that if you are away
that day maybe that's ok). We'll arrange the same sort of
schedule for him.
Don't forget Steve Zucker will be coming on April 23.
-Nils
-------
∂06-Mar-85 1904 WITHGOTT@SU-CSLI.ARPA Informal gathering to discuss representations (1)
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 6 Mar 85 19:04:32 PST
Date: Wed, 6 Mar 1985 19:01 PST
Message-ID: <WITHGOTT.12092997892.BABYL@SU-CSLI.ARPA>
From: WITHGOTT@SU-CSLI.ARPA
To: Researchers@SU-CSLI.ARPA
Subject: Informal gathering to discuss representations (1)
WHEN: Tuesday, March 12 at 11:25
WHERE: Ventura Classroom (Trailer D)
TOPIC: Representations >SUBTOPIC: Sound in language
Bring a lunch or food to share. Please forward this to
other individuals who may be interested.
-- Meg Withgott (494-4389)
∂06-Mar-85 1950 CL.BOYER@UTEXAS-20.ARPA dinosaurs
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 6 Mar 85 19:50:41 PST
Date: Wed 6 Mar 85 21:50:25-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: dinosaurs
To: jmc@SU-AI.ARPA
Our net connection has been poor, so I may have missed it, but
did Pratt or Reid or anyone respond to your dinosaur defense?
-------
∂07-Mar-85 0344 YM two questions
1) What is the correct refernce to "Lisp Programming and Proving"?
2) What is the directory for keeping Tech Reports?
Thanks,
Yoni.
∂07-Mar-85 0945 VARDI@SU-CSLI.ARPA Re: Modal Logic
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 09:45:09 PST
Date: Thu 7 Mar 85 09:41:30-PST
From: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Subject: Re: Modal Logic
To: pratt@SU-NAVAJO.ARPA
cc: finterest@SU-CSLI.ARPA, fagin.ibm-sj@CSNET-RELAY.ARPA,
halpern.ibm-sj@CSNET-RELAY.ARPA
In-Reply-To: Message from "Vaughan Pratt <pratt@Navajo>" of Tue 5 Mar 85 19:24:00-PST
In possible-worlds semantics the propositions are defined in terms of the
worlds. In algebraic secmatics the worlds are defined in terms of the
propositions. To you these two perspectives are equally viable, and thus
both are philosophically satisfying. To me, and to many other people,
the first perspective is more intuitive. To some people, the second
perspective is more intuitive. At any rate, how do you explain the fact that
modal logic started to really proliferate only after the introduction of
possible-worlds semantics?
Moshe
-------
∂07-Mar-85 1100 RA Herbert Greenberg
The Math department does not have a visitor by this name.
∂07-Mar-85 1143 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
The next meeting will be held on Wednesday, March 13, at 2:00 pm, in MJH 252.
We will continue discussing my paper, "Computing Circumscription".
- Vladimir
∂07-Mar-85 1145 STAN@SRI-AI.ARPA Gaifman
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 11:45:36 PST
Date: Thu 7 Mar 85 11:45:01-PST
From: STAN@SRI-AI.ARPA
Subject: Gaifman
To: jmc@SU-AI.ARPA
cc: stan@SRI-AI.ARPA
John, I got a letter from Haim Gaifman (whom I know from Jerusalem)
indicating that he would like to spend his upcoming leave in the
Stanford area and requesting support from the AI Center. He also
indicated he wrote to Barwise & suggested that perhaps a "joint"
arrangement of some sort could be worked out. I spoke to Jon & he
said he would commit a small part of his personal initiator funds, but
that he couldn't promise anything from CSLI as a whole. In a later
message he indicated that Suppes was interested and that you might be
as well. I would like to get back to Gaifman soon, and affirmatively if
possible. Has Pat spokent to you, and do you have any interest?
--Stan
-------
∂07-Mar-85 1230 EENGELMORE@SUMEX-AIM.ARPA Reminder/Delaney/Lincoln/3-11
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 12:30:13 PST
Date: Thu 7 Mar 85 12:26:48-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: Reminder/Delaney/Lincoln/3-11
To: Nii@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA, Delagi@SUMEX-AIM.ARPA,
rpg@SU-AI.ARPA, jmc@SU-AI.ARPA, rindfleisch@SUMEX-AIM.ARPA
cc: Feigenbaum@SUMEX-AIM.ARPA, EENGELMORE@SUMEX-AIM.ARPA
Refer to msg from Feigenbaum, Tue 19 Feb 85
John Delaney, Lincoln Labs, will be at HPP Monday, March 11. The
WR Conference Room is available for meeting with him only until
10:30am. Other places, other rooms can be found for the rest of
the time.
Do you want a schedule for meetings with him or do you want to let
things just fall in (or out of) place?
If you want a schedule...do you already have one (about which I
know nothing) or would you like an attempt at making one? In
the latter case, please let me know 1) your preferred times for
meeting with Delaney and 2) times which are impossible for you.
Ellie
-------
∂07-Mar-85 1309 NISSENBAUM@SU-CSLI.ARPA CSLI Seminar
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 13:09:10 PST
Date: Thu 7 Mar 85 13:04:53-PST
From: Helen Nissenbaum <NISSENBAUM@SU-CSLI.ARPA>
Subject: CSLI Seminar
To: researchers@SU-CSLI.ARPA
There are a few dates open for the 2.15 seminar, Spring Quarter. This is
a forum for members of CSLI to describe their work. If you would like to
give a seminar and have not been approached by Stuart Shieber or myself,
please let us know. Otherwise we may have to continue to use "strongarm
tactics" to get people to speak up.
-------
∂07-Mar-85 1329 NILSSON@SU-SCORE.ARPA [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: Robotics Applicants]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 13:29:00 PST
Date: Thu 7 Mar 85 13:26:11-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: Robotics Applicants]
To: reynolds@SU-SCORE.ARPA, cannon@SU-SIERRA.ARPA, tob@SU-AI.ARPA,
jmc@SU-AI.ARPA, ffl@SU-AI.ARPA, bureaucrat@SU-SCORE.ARPA
FYI.
---------------
Mail-From: NILSSON created at 7-Mar-85 13:21:00
Date: Thu 7 Mar 85 13:20:58-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Robotics Applicants
To: faculty@SU-SCORE.ARPA
The robotics search committee (Cannon, Reynolds, McCarthy, Binford,
Nilsson) is inviting some potential applicants for a robotics
faculty position to Stanford. Currently we have Mike Brady of
MIT scheduled to visit on Thursday, March 21; Marc Raibert of
CMU scheduled to visit on Thursday, March 28; and Steve Zucker
of McGill scheduled to visit on Tuesday April 23. Each will
give a talk at 4:15 (abstracts, talk location to follow). (Zucker
will give the CS colloquium on April 23.) The search committee
will, as a group, talk to these people from around 2:30 to just
before their talks (taking a break for cookies, etc. in the third
floor lounge just before the talk). I'll be hosting each of them
for lunch at the faculty club--faculty interested in joining us
for lunch should contact Fran Larsen (ffl@sail). Faculty interested
in talking with these people while they are here should also arrange
an appointment thru Fran Larsen. Betty Scott (and probably Fran
Larsen) will have copies of vitae. We also hope that the applicants
can meet with some student representatives. -Nils
-------
-------
∂07-Mar-85 1343 FFL Meeting of Search Committee with candidate, Marc Raibert
To: TOB, JMC, FFL
Marc Raibert will be here, Thursday, March 28. Nils asks that the
Search Committee meet with him that day at 2:30 p.m. in Chairman's
Conference Room.
A Search Committee meeting was already scheduled for 2 p.m. that day.
It will just be moved to 2:30 instead.
∂07-Mar-85 1346 NII@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 13:46:42 PST
Date: Thu 7 Mar 85 13:44:02-PST
From: Penny Nii <NII@SUMEX-AIM.ARPA>
Subject: Re: Reminder/Delaney/Lincoln/3-11
To: EENGELMORE@SUMEX-AIM.ARPA
cc: Brown@SUMEX-AIM.ARPA, Delagi@SUMEX-AIM.ARPA, rpg@SU-AI.ARPA, jmc@SU-AI.ARPA,
rindfleisch@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA, NII@SUMEX-AIM.ARPA
In-Reply-To: Message from "Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>" of Thu 7 Mar 85 12:26:56-PST
Ellie,
We should certainly arrange a lunch.Mondy noon is usaully our Proj. mgrs mtg
so most of us should be free. How about the faculty club? I am free
between 10:15 and 3:30.
penny
-------
∂07-Mar-85 1425 RINDFLEISCH@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 14:25:18 PST
Date: Thu 7 Mar 85 14:05:34-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Re: Reminder/Delaney/Lincoln/3-11
To: EENGELMORE@SUMEX-AIM.ARPA, NII@SUMEX-AIM.ARPA
cc: Brown@SUMEX-AIM.ARPA, Delagi@SUMEX-AIM.ARPA, rpg@SU-AI.ARPA, jmc@SU-AI.ARPA,
Feigenbaum@SUMEX-AIM.ARPA
In-Reply-To: Message from "Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>" of Thu 7 Mar 85 14:03:33-PST
I can go, Ellie. Tom R.
-------
∂07-Mar-85 1439 RA leave early
It's Thursday again, I am leaving early for class. See you tomorrow.
∂07-Mar-85 1507 EENGELMORE@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 15:07:46 PST
Date: Thu 7 Mar 85 14:03:15-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: Re: Reminder/Delaney/Lincoln/3-11
To: NII@SUMEX-AIM.ARPA
cc: Brown@SUMEX-AIM.ARPA, Delagi@SUMEX-AIM.ARPA, rpg@SU-AI.ARPA, jmc@SU-AI.ARPA,
rindfleisch@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
EENGELMORE@SUMEX-AIM.ARPA
In-Reply-To: Message from "Penny Nii <NII@SUMEX-AIM.ARPA>" of Thu 7 Mar 85 13:44:07-PST
You have a reservation (in the Name of Feigenbaum) for six people
for lunch at the Faculty Club at noon, Monday, March 11. There are
no private rooms available.
Who's going?
Ellie
-------
∂07-Mar-85 1511 CWR reference
[cwr] who did the 1958 paper with commons sense programs?
∂07-Mar-85 1527 DELAGI@SUMEX-AIM.ARPA Re: Reminder/Delaney/Lincoln/3-11
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Mar 85 15:27:33 PST
Date: Thu 7 Mar 85 15:11:37-PST
From: Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>
Subject: Re: Reminder/Delaney/Lincoln/3-11
To: EENGELMORE@SUMEX-AIM.ARPA
cc: Nii@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA, rpg@SU-AI.ARPA, jmc@SU-AI.ARPA,
rindfleisch@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA
In-Reply-To: Message from "Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>" of Thu 7 Mar 85 12:26:54-PST
I can go to lunch ... and meet with him at 11............../bruce
-------
∂08-Mar-85 0643 @MIT-MC:RICH@MIT-OZ AAAI Conference Proposals
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 8 Mar 85 06:40:30 PST
Received: from MIT-OZ by MIT-MC via Chaosnet; 8 MAR 85 09:39:23 EST
Date: 8 Mar 1985 09:39 EST (Fri)
Message-ID: <RICH.12093387067.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, JMC@SU-AI.ARPA,
MCdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA,
Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stefik.PA@XEROX.ARPA,
tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA
Subject: AAAI Conference Proposals
A few thoughts on the one vs. two conference issue:
Despite Marty's denial, the National Conference, specifically the
tutorial program, *is* AAAI's "cash cow". I am concerned that an
important contribution to the lustre of our tutorial program is
its close association with the research conference. This
differentiates it from the multitude of other AI courses being
hawked these days. Separating the tutorials from the research
conference could backfire in tutorial attendance figures.
Am I correct in asserting that if we had to single out one
problem that we most want to fix with these new proposals, it
is that there are too many people at the technical paper
sessions, i.e. 1000 or more as opposed to a 100 or so; and
that this changes the tone of the presentations, i.e. presenters
tend to "talk down" a bit, and it isn't possible to have real
discussion in the question periods?
Thinking further about how to structure one event to fix
this problem, I would like to suggest the following refinement
to Mark's suggestion.
Somehow I feel it might work better to have the research part of the
conference first rather than last. It just seems to me that the
"tourists" we want to discourage from attending technical sessions are
more likely to come for the tutorials and exhibits and stay late,
rather than come early. Associated workshops (such as AI in Medicine)
and birds-of-a-feather meetings could still overlap with the
non-research portion of the conference.
Also, given the constraint (which I don't know how hard it is to
satisfy) that we use towns in which there are both university
facilities and a commercial conference center, I suggest we hold the
research portion in the university (perhaps including housing) and the
tutorial/exhibit part in the conference center (with associated
hotels). I think the inconvenience for the research community to
travel to see the exhibits might be well balanced by the effect on the
commercial community of keeping them from casually dropping in on the
technical sessions.
An issue that isn't quite clear in this model is what else there
would be in the more public part of the conference except tutorials
and exhibits. I expect we would have mostly the usual panels and invited
lectures. These would not be duplicated in the research portion of
the conference, because the researchers could stay for them if they
wished.
Anyways, we obviously are going to need to experiment over the next
few years to debug whatever conference model we evolve. I, for one,
vote we start debugging from a modified single event first before
we go to the more drastic two event approach.
-Chuck.
∂08-Mar-85 0829 JJW Eagle drives for 3600s
To: Tom@SU-SCORE.ARPA, Bosack@SU-SCORE.ARPA, Jock@SU-SCORE.ARPA,
JMC@SU-AI.ARPA
We probably only want one Eagle for now, since it mainly needs to accomodate
the increased system filespace needs. Lisp Machine users are still
encouraged to keep their files backed up on other systems because there are
no backups on the 3600s. Will the quantity 1 price from this company be
much worse?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Mar 85 07:47:40 PST
Date: Fri 8 Mar 85 07:46:31-PST
From: Thomas Dienstbier <TOM@SU-SCORE.ARPA>
Subject: eagle drives
To: bosack@SU-SCORE.ARPA, jjw@SU-AI.ARPA
The best price that I was able to get on eagle drives is from a
company by the name of DEX Corp. in San Jose.. In quanity of 2's
the price is 8950.00. 150.00 additional cables..so, were talking
18,000 19,000...
tom
-------
∂08-Mar-85 0915 RA Computer Science Chairperson for UC Davis
Barbara Sargent called re leads for qualified people for the position
of Chair for the CS Depart. at UC Davis.
Her tel: (415) 961 6980.
∂08-Mar-85 1107 LES Random events and queries
Betty Scott finally agreed to review your accounts with me this afternoon,
so I'll be there in the 2-4 time period.
For what its worth, I noticed in the Wall Street Journal the other day
that Encore is admitting to substantial delays in their initial deliveries.
I would like to educate myself about Common Lisp, which seems to have
happened since I wandered off. What is the definitive documentation?
I also need to relearn (or, more accurately, learn) Lisp programming.
Know of a good tutorial? Or an interesting problem?
∂08-Mar-85 1138 RA looking for you
John Cocke came by to see you. He'll come by later. When are you
going to come in today?
∂08-Mar-85 1544 Tenenbaum@SRI-KL.ARPA Re: AAAI Conference Proposals
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 8 Mar 85 15:44:08 PST
Date: Fri 8 Mar 85 14:01:06-PST
From: Marty Tenenbaum <Tenenbaum@SRI-KL>
Subject: Re: AAAI Conference Proposals
To: RICH%MIT-OZ%MIT-MC@SRI-KL
cc: AAAI-OFFICE%SUMEX-AIM@SRI-KL, Amarel%RUTGERS@SRI-KL, ai.woody%MCC@SRI-KL,
Fikes%USC-ECL@SRI-KL, Brachman@SRI-KL, Davis%MIT-OZ%MIT-XX@SRI-KL,
Genesereth%SUMEX-AIM@SRI-KL, Buchanan%SUMEX-AIM@SRI-KL,
Engelmore%SUMEX-AIM@SRI-KL, Lerman%SRI-KL@SRI-KL, JMC%SU-AI@SRI-KL,
MCdermott%CMU-CS-A@SRI-KL, Reddy%CMU-CS-A@SRI-KL, Rich%MIT-MC@SRI-KL,
Stan%SRI-AI@SRI-KL, Shortliffe%SUMEX-AIM@SRI-KL, Stefik.PA%Xerox@SRI-KL,
PHW%MIT-MC@SRI-KL, hart%SRI-AI@SRI-KL
In-Reply-To: Message from "Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>" of Fri 8 Mar 85 09:39:00-PST
Chuck,
Claudia and I have been discussing a proposal very similar to your
modification of Stefik's (i.e., one back-to-back conference,
research part first, that part to be held on a campus). I have
asked her to prepare a formal proposal to that effect for the
1986 conference. I think it is wise to get some experience with
this intermediate form, and then reconsider the two conference
proposal in that light.
Marty.
-------
∂08-Mar-85 1628 RA Talk at American Acad. lunch group
Is April 3 ok with you for your talk at the American Academy lunch group?
What is the topic of your talk?
∂08-Mar-85 1654 CLT
how about dinner with scherlis tomorrow evening?
∂09-Mar-85 1251 GOGUEN@SU-CSLI.ARPA Re: David Harel
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Mar 85 12:50:47 PST
Date: Sat 9 Mar 85 12:29:55-PST
From: Joseph Goguen <GOGUEN@SU-CSLI.ARPA>
Subject: Re: David Harel
To: BARWISE@SU-CSLI.ARPA
cc: Pereira@SU-CSLI.ARPA, Meseguer@SU-CSLI.ARPA, Stan@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Tw@SU-AI.ARPA, Vardi@SU-CSLI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Fri 1 Mar 85 08:39:59-PST
David Harel has also written to SRI (and no doubt many other places) and
SRI is expecting to make him an offer for summer support; part of his
funding will come from my project, and if anyone at CSLI has an interest
in anything he is doing or has done, I can encourage him to talk to that
person. Perhaps we should at least plan on his giving a talk in the Area
C seminar, if he does come to SRI (which seems likely), perhaps on some
of his work on dynamic logic (an approach to concurrency).
Joseph
-------
∂10-Mar-85 1214 CLT fine
∂10-Mar-85 1504 reiter%ubc.csnet@csnet-relay.arpa ijcai award
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 10 Mar 85 15:03:59 PST
Received: from ubc by csnet-relay.csnet id a026987; 10 Mar 85 17:56 EST
Received: from ubc-vision.UUCP by ubc.csnet id AA19998; Sun, 10 Mar 85 14:48:13 pst
Date: Sun, 10 Mar 85 14:52:35 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8503102252.AA19775@ubc-vision.UUCP>
Received: by ubc-vision.UUCP id AA19775; Sun, 10 Mar 85 14:52:35 pst
To: JMC@SU-AI.ARPA
Subject: ijcai award
Dear John
I would like to nominate you for the IJCAI Award for Research Excellence.
This award is "to honour sustaned excellence in AI research ... to a
scientist who has carried out a program of research of consistently high
quality yielding several substantial results."
In order to put your name forward I need your prior agreement. I also need
to submit a short description of your qualifications wrt the above criteria
for the award. Are you willing to be nominated? If so, could you send me your
CV, preferably electronically, to guide me in writing the nomination? The
deadline for nominations is March 31.
With best wishes,
Ray.
∂11-Mar-85 0835 BARWISE@SU-CSLI.ARPA Re: talking in my class
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Mar 85 08:35:05 PST
Date: Mon 11 Mar 85 08:33:21-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Re: talking in my class
To: JMC@SU-AI.ARPA
cc: briansmith@XEROX.ARPA, stan@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 9 Mar 85 16:57:00-PST
By this time anything I would have to day about the use of logical
formalisms in robots would be pretty pale compared with what Stan R on
the one hand, and Brian S, on the other, would say. I think you would
get two very useful and different perspectives from them. And, in any
case, my time is just swamped this quarter.
-------
∂11-Mar-85 0900 JMC*
reservations to France
∂11-Mar-85 1003 VAL employment with Stanford
You said once that I would be able to continue working here half time through
the next academic year, and that it would be full time during the summer months.
Is it a firm offer? If yes, I'll try to make appropriate arrangements with
San Jose State.
- Vladimir
∂11-Mar-85 1009 CLT okner
To: JMC, CLT
friday 10:30 am
∂11-Mar-85 1010 CLT
no supper tonight - opera on TV
∂11-Mar-85 1015 EENGELMORE@SUMEX-AIM.ARPA RE: Delaney/Lincoln
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Mar 85 10:15:20 PST
Date: Mon 11 Mar 85 09:59:21-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: RE: Delaney/Lincoln
To: Nii@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA, Delagi@SUMEX-AIM.ARPA,
rpg@SU-AI.ARPA, jmc@SU-AI.ARPA, rindfleisch@SUMEX-AIM.ARPA,
Feigenbaum@SUMEX-AIM.ARPA
cc: EENGELMORE@SUMEX-AIM.ARPA
Because the Protean meeting will not take place today, the WR
Conf Room is available to you through the morning.
The lunch reservation at the Faculty Club is at noon. Dick Gabriel
will try to meet you there. The following people have also said that
they would be at lunch: Nii, Rindfleisch, Delagi, Brown.
The only other bits of information I have are that Brown can meet with
Delaney anytime today; Nii, anytime between 10:30 and 3:30; Delagi,
11:00.
-------
∂11-Mar-85 1101 RA a visit by Dr. Winter from DFLVR
Dr. Heinz Winter is from a German research governmental organization
which deals with aeronautics and space (like NASA). He is going to be
here March 21 and 22 and would like to see you. He sent you a letter
and a brochure about his organization (I put it on top of your desk).
I looked at your calendar and it seems that you are going
to be in France on those days, is this indeed the case?
He will call back tomorrow, what shall I tell him.
∂11-Mar-85 1223 RR29@CMU-CS-A.ARPA Resnick's phone number
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 11 Mar 85 12:23:37 PST
Date: 11 Mar 85 1519 EST (Monday)
From: Raj.Reddy@CMU-CS-A.ARPA
To: John McCarthy <JMC@SU-AI.ARPA>
Subject: Resnick's phone number
CC: Phyllis.Pomerantz@CMU-CS-A.ARPA
In-Reply-To: "John McCarthy's message of 9 Mar 85 17:47-EST"
Message-Id: <11Mar85.151916.RR29@CMU-CS-A.ARPA>
Dan Resnick's home phone number in Paris is
011-33-1-651-4016. His net address is
DR0Q@CMU-CC-TF. This net address gets forwarded
to the Centre Mondial.
Phyllis Pomerantz
Secy to Raj Reddy
∂11-Mar-85 1314 BSCOTT@SU-SCORE.ARPA Re: offer to Vladimir Lifschitz
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Mar 85 13:14:44 PST
Date: Mon 11 Mar 85 13:06:13-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: offer to Vladimir Lifschitz
To: JMC@SU-AI.ARPA, RA@SU-AI.ARPA, les-here@SU-AI.ARPA
cc: VAL@SU-AI.ARPA, BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 11 Mar 85 11:23:00-PST
We already have Lifschitz on the payroll through summer (summer @ 100%),
but we'll probably have to process a regular appointment for him for next
year. At the present he is a Visiting Research Associate, but this status
is limited to a one-year appointment.
Betty
-------
∂11-Mar-85 1315 RR29@CMU-CS-A.ARPA Dan Resnick
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 11 Mar 85 13:15:31 PST
Date: 11 Mar 85 1607 EST (Monday)
From: Raj.Reddy@CMU-CS-A.ARPA
To: McCarthy@SU-AI.ARPA
Subject: Dan Resnick
Message-Id: <11Mar85.160751.RR29@CMU-CS-A.ARPA>
Here is a message from him. Pls send it via CMUA
Raj
- - - - Begin forwarded message - - - -
Return-Path:<@CMU-CC-TE:DR0Q@CMU-CC-TF>
Received: from CMU-CC-TE.ARPA by CMU-CS-A.ARPA; 11 Mar 85 08:56:26 EST
Received: from CMCCTF by CMCCTE; 11 Mar 85 08:56:46 EST
Received: ID <DR0Q@CMU-CC-TF>; 11 Mar 85 08:55:45 EST
Date: 11 Mar 85 08:55:45 EST
From: DR0Q@CMCCTF <DR0Q@CMU-CC-TF>
Subject: time to talk
To: rr29@CMU-CS-A.ARPA
I think you should call me at home some time in
the next few days. Tel 651-40-16. 5:00-5:30
your time is good. If today, it would have to
be 5:30 -6:00 your time.
Dan
-------
- - - - End forwarded message - - - -
∂11-Mar-85 1342 RA Some expert systems need common sense
Do you have this paper on line? All I found in the filing cabinet
was something which started with p. 11 "Ansers to questions:"
∂11-Mar-85 1405 RA Inference, meeting Friday
Richard Schroeppel from Inference re reminding you of the meeting
on Friday. His tel: (213) 417 7997
∂11-Mar-85 1522 CLT
To: JMC, CLT
okner 11am thursday
∂12-Mar-85 0923 CLT
no supper tonite (tue) or tomorrow (wed)
∂12-Mar-85 1240 RA Visitors from mainland China
Prof. Wei-Huang is the superintendent of 4-5 computer professionals
from mainland China who are now visitng HP. The Chinese are intersted
in translations from Mandarin to Cantonese and to Western languages.
He is looking for a foreign liason person to establish a contact between
the visitors and Stanford. Should he call you, or is there anybody
else he can contact.
His number is (56) 996 9800.
∂12-Mar-85 1352 RA MYCIN
A Dr. Kalman (213) 556 8412 is interested in MYCIN software; who can he contact
about it? He'll call back, so please let me know.
∂12-Mar-85 1408 RA tickets
Your ticket to LA is on your desk.
∂12-Mar-85 1431 RA AAAI conference
Is there going to be an AAAI conference on common sense in April or
May this year? Please let me know.
∂12-Mar-85 1441 RA ffice of Research and Development in an interested party to it.
Garo Kiremidjiam from DELFIN systems called (56) 295 1818 re
preliminary discussion of you possible paricipation in a conference
or session on AI technology assessment for set of problems. The US
Office of Research and Development is an interested party to it.
con-Mar-85 1457 RA Queue-based multi-processing lisp paper
The 1984 ACM version of the paper which is in your file cabinet is
missing its page 7. Is there anywhere else I can find the paper?
∂12-Mar-85 1502 RA
∂08-Mar-85 1628 RA Talk at American Acad. lunch group
To: JMC
Is April 3 ok with you for your talk at the American Academy lunch group?
What is the topic of your talk? Please let me know.
∂13-Mar-85 2140 RPG AAAI-86
Could you let me know as soon as you can when AAAI-86 will be held?
The Lisp conference will be at MIT in 1986, and we want to schedule it
during a different week from AAAI-86 week. That is, the Lisp conference
is divorcing AAAI because of the scheduling unpleasantness the Lisp
conference suffered in Austin and in Pittsburgh.
-rpg-
∂14-Mar-85 0900 JMC*
Nag MAD and Inference about 1099.
∂14-Mar-85 0950 FFL NEW PHONE
To: golub@SU-SCORE.ARPA, DEK@SU-AI.ARPA, lantz@SU-SCORE.ARPA,
mayr@SU-SCORE.ARPA, JMC@SU-AI.ARPA, oliger@SU-SCORE.ARPA,
yao@SU-SCORE.ARPA, FFL@SU-AI.ARPA
We are trying to firm up your telephone requirements this week. I would
like to speak to you about yourneeds and "take your order." Could you
let me know when you come in and can give me a few minutes on Thursday
or Friday. ffl@sail or 7-9745. Fran Larson
∂14-Mar-85 1113 LAMPING@SU-SCORE.ARPA Prospective Student Visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Mar 85 11:13:42 PST
Date: Thu 14 Mar 85 10:59:03-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Prospective Student Visit
To: JMC@SU-AI.ARPA
Timothy Fernando, an admittee for next year, will be visiting here
starting March 21 (a week from this Friday). He would like to talk
to you. Will you be around and available sometime that day, or
the following weekend or the next Monday?
-------
∂14-Mar-85 1121 reid@Glacier lisp birthday?
Received: from SU-GLACIER.ARPA by SU-AI.ARPA with TCP; 14 Mar 85 11:21:46 PST
Date: Thu, 14 Mar 85 11:20:48 pst
From: Brian Reid <reid@Glacier>
Subject: lisp birthday?
To: JMC@Sail
According to an entry in a Unix calendar file, today is the 25th
anniversary of the "introduction" of Lisp. Do you have any recollection
of what March 14, 1960 might have been? Publication of the LISP paper?
Demonstration of the interpreter?
∂14-Mar-85 1409 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Next seminar:
Speaker: John McCarthy
Topic: Prioritized Circumscription
Time: 2-3 pm, Wednesday, March 20
Place: MJH 252
∂14-Mar-85 1459 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Correction: we don't meet on March 20 because the speaker is going to
be out of town. The next meeting will be on March 27 instead.
∂14-Mar-85 1655 THEODOROU@SU-SCORE.ARPA PhD visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Mar 85 16:55:08 PST
Date: Thu 14 Mar 85 15:39:03-PST
From: Dimitris Theodorou <THEODOROU@SU-SCORE.ARPA>
Subject: PhD visit
To: mccarthy@SU-SCORE.ARPA
this is the reminder you requeste about scheuling the appointment with
incoming PhD student Timothy Fernando on March 25
please let me know of a time slot as soon as possible so he can schedule
his flight
thank you
Dimitris Theodorou
PS-- this is the same student John Lamping talked to you about
-------
∂15-Mar-85 1431 RA Australian minister of science
Bryan Brook from the Australian consulat called (55) 362 6160 and
said that Barry Jones who is the Australian minister of science
is going to be in SF on April 22 (Mon.) and 23 (Tues.) and would
like to meet with you. Would you like to meet with him? if yes,
do you want him to come to Stanford? Please let me know.
∂16-Mar-85 0406 derek%nmsu.csnet@csnet-relay.arpa
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 16 Mar 85 04:06:30 PST
Received: from nmsu by csnet-relay.csnet id aa02050; 16 Mar 85 7:02 EST
Received: by nmsu.csnet (4.12/)
id AA00965; Fri, 15 Mar 85 15:29:12 mst
Date: Fri, 15 Mar 85 15:29:12 mst
From: Derek Partridge <derek%nmsu.csnet@csnet-relay.arpa>
To: jmc@su-ai.ARPA
Yorick sends apologies for perplexing messages last week,
we were lead to believe that you would be in Albuquerque
last Thursday (we now think that there is another John
McCarthy!).
Back to business,Claudia Mazzetti needs your ok in order to send funds
to support our Foundations of AI Workshop,if you agree to this support
please let Cluadia know.She suggests that $5,000 or even $10,000 might
be extent of the financial backing,we would of course prefer the latter
sum,please let me know if there is any information that I can supply in
order to facilitate your decision.
Secondly,we would appreciate your presence at the conference and a
position paper (perhaps along the lines of your AI Magazine call for
standards in AI research).If there is anything we can do to persuade
you to accept our invitation,again let me know your concerns.
∂16-Mar-85 1333 JM01@CMU-CS-A.ARPA Re: Two Recommendations from the Conference Committee
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 16 Mar 85 13:33:08 PST
Date: 16 Mar 85 1626 EST
From: John.McDermott@CMU-CS-A.ARPA (A312JM01)
To: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Re: Two Recommendations from the Conference Committee
CC: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, JMC@SU-AI.ARPA,
John.McDermott@CMU-CS-A.ARPA, Raj.Reddy@CMU-CS-A.ARPA,
Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Stefik@XEROX.ARPA, tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA,
hart@SRI-AI.ARPA
In-Reply-To: "AAAI's message of 1 Mar 85 14:41-EST"
With respect to letting others use our good name: I would like to see
the simplest possible mechanism consistent with quality control; the
proposed mechanism strikes me as somewhat less simple than necessary,
but most of the information that mechanism would collect seems to me
to be necessary for quality control.
With respect to two conferences: I think the current national conference
has three pretty distinct constituencies: (1) AI researchers, (2) people
who know something about AI and who are building AI application systems,
not to break new ground in AI, but to help the organization they belong
to solve some problem, and (3) people who want to learn a little something
about AI. We serve the first and third of these constituencies fairly
well. What might best serve the second constituency is some papers
each of which describe how well-known AI techniques were used to develop
a usable system and what non-AI problems had to be solved to get that
system used. Adjacent meetings (or tutorials) for each constituency
with three different and loudly proclaimed purposes strikes me as a
good idea. I'm the program chairperson for IJCAI-87. I'd be interested
in your reactions to the Stefik-like idea of an IJCAI program where the
first two days were for constituency #3, the next day for constituency
#2 and the last three days for constituency #1. (I think that by 1987
there will be enough AI systems in use that we could get a whole day's
worth of above threshold papers.)
I don't think being held at universities make conferences more scientific,
nor does smallness. What makes conferences scientific is quality papers
and quality lecture halls.
∂16-Mar-85 1453 @MIT-MC:DAVIS@MIT-OZ Re: Two Recommendations from the Conference Committee
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 16 Mar 85 14:53:32 PST
Received: from MIT-OZ by MIT-MC via Chaosnet; 16 MAR 85 17:52:39 EST
Date: Sat 16 Mar 85 17:52:07-EST
From: Randall Davis <DAVIS%MIT-OZ@MIT-MC.ARPA>
Subject: Re: Two Recommendations from the Conference Committee
To: John.McDermott@CMU-CS-A.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA, Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA,
Fikes@USC-ECL.ARPA, Brachman@SRI-KL.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, JMC@SU-AI.ARPA,
Raj.Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA, tenenbaum@SRI-KL.ARPA,
PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA
In-Reply-To: Message from "John.McDermott@CMU-CS-A.ARPA (A312JM01)" of Sat 16 Mar 85 16:26:00-EST
Re: John's comment about scientific conferences:
Smallness does make conferences more scientific I think -- or more precisely
it makes them of much more use to the scientists. Informal interactions and
a chance to talk unhassled are getting to be rare commodities, especially
for people you don't get to see easily. We should guard that opportunity
jealously and we have currently lost it in the AAAI and IJCAI conferences.
Quality papers help a lot, but we still lose something very important if
there are 800 people in the paper session and four thousand more milling
around outside.
As for universities: the feeling seems to be that hotels and conference
centers rarely have good lecture halls (sloped floors, decent seats, etc.)
Perhaps because that makes them single-purpose rooms and hotels can't
afford that. Universities can, hence the desire for university settings.
Second motivation is desire for cheap grad student housing. Hotels can
rarely compete with what dorms charge. AAAI may be fairly well to do, but
we did a quick calc at the 84 AAAI ExCom mtg and it's amazing how fast you
can eat up money by underwriting the cost of student housing in a big hotel.
-------
∂16-Mar-85 1532 JM01@CMU-CS-A.ARPA Re: Two Recommendations from the Conference Committee
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 16 Mar 85 15:32:19 PST
Date: 16 Mar 85 1827 EST
From: John.McDermott@CMU-CS-A.ARPA (A312JM01)
To: Randall Davis <DAVIS%MIT-OZ@MIT-MC.ARPA>
Subject: Re: Two Recommendations from the Conference Committee
CC: AAAI-OFFICE@SUMEX-AIM.ARPA, Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA,
Fikes@USC-ECL.ARPA, Brachman@SRI-KL.ARPA, Davis%MIT-OZ@MIT-XX.ARPA,
Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, JMC@SU-AI.ARPA,
Raj.Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA, tenenbaum@SRI-KL.ARPA,
PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA
In-Reply-To: "Randall Davis's message of 16 Mar 85 17:52-EST"
I spoke imprecisely about smallness. I should have said that I can't tell the
difference, with respect to scientificness, between a conference attended by
500 scientists and a conference attended by 500 scientists and 3500
non-scientists. (I can tell the difference between a conference attended by
20 scientists and a conference attended by 500 scientists.)
Also, I'm not against conferences at Universities. I'm for conferences at
places with good facilities. If that meant (which I doubt) that we would have
to go to Universities and in so doing limit the number of attendees to 1000,
I'd vote for that (though maybe not until after someone proposed a plausible
and legal mechanism for keeping the number of AI researchers and connoisseurs
of AI research below that limit). [I realize that no one is proposing a limit
and that the idea is that if a conference is well-known to be of no possible
interest to anyone but scientists that self-selection will keep the number of
attendees "small". I think to believe that is to radically underestimate the
number of connoisseurs of AI research in the world.]
∂16-Mar-85 1835 LES ARPA review
I called Squires again toward the end of his day on Friday and finally
reached him. He made it as clear as any government person can that they
plan to fund the project and that he thinks they have adequate funding.
He repeated his earlier remark to you about his desire that the proposal
not be firm on the choice of computer. When I mentioned the seemingly
different guidance that Kahn had given he said "Yes, he likes for
proposals to be very specific about that kind of thing but I don't."
I agreed that we would use the Sequent machine as an example for budgeting
purposes but that the proposal would not take a firm position, since I
knew that is what you preferred all along.
I think that we should proceed with getting the proposal in final form.
It just occured to me, however, that I neglected to ask the question about
their preference with regard to the Fateman funding channel. In any case,
I believe that we should ask Fateman for a formal proposal to us. Yes?
∂16-Mar-85 2228 LES Proposal
Squires was planning to review their internal planning with Kahn next
week. One of his remarks was that "I shouldn't tell you this, but given
the people in your group, we are much less concerned about the specific
wording of your proposal than we are about proposals from groups in which
we have less confidence."
Regarding Fateman, remember that Berkeley's procedure for producing and
reviewing proposals can be only partly overlapped with ours. I have no
knowledge of their normal throughput delays.
Would you like to get in touch with Fateman or should I? Or would you
like to have another face-to-face discussion with him?
∂16-Mar-85 2326 gnelson@decwrl.ARPA Industrial Lecturer
Received: from DECWRL.ARPA by SU-AI.ARPA with TCP; 16 Mar 85 23:26:24 PST
Received: from magic.ARPA by decwrl.ARPA (4.22.01/4.7.34)
id AA07461; Sat, 16 Mar 85 23:26:03 pst
Received: by magic.ARPA (4.22.01/4.7.34)
id AA11889; Sat, 16 Mar 85 23:25:36 pst
Date: Sat, 16 Mar 85 23:25:36 pst
From: gnelson@decwrl.ARPA (Greg Nelson)
Message-Id: <8503170725.AA11889@magic.ARPA>
To: jmc@sail
Subject: Industrial Lecturer
Cc: gnelson@decwrl.ARPA
Nils Nilsson told me that you were in charge of a Stanford CS program
that invited one visiting professor per quarter from industrial
laboratories to lecture at Stanford. I would be interested in
applying. My interests are in the area of programming language
semantics. Please let me know what the program is like, and
whether there are any openings for which I might apply.
Greg Nelson
DEC Systems Research Lab
130 Lytton Ave.
Palo Alto, CA 94301
415 853 2234
gnelson@decwrl
∂17-Mar-85 0346 REGES@SU-SCORE.ARPA Re: CSD Faculty/Staff phone list
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Mar 85 03:46:16 PST
Date: Sun 17 Mar 85 03:46:08-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Re: CSD Faculty/Staff phone list
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 17 Mar 85 00:28:00-PST
Office: Margaret Jacks 210, 497-9798
All such lists are generated from the central people database on SCORE. PEDIT
is our main program for manipulating the data, but it only runs on SCORE and is
not always the easiest program to use.
For people like yourself who don't work on SCORE much, your requests should be
directed to our receptionist, Kim Tuley (TULEY@SCORE). She uses PEDIT often
enough that she is (or soon will be) an expert on entering and changing
information in the database. I've sent your message to her and will work with
her to make sure that all of your requests are carried out.
Thanks for providing the information about Ketonen, Gabriel, Lifschitz and
Earnest, and the suggestion about adding the Industrial Lecturers to the
database. I don't have the time to track down all the things that should be
added and corrected, so I rely on help like this.
-------
∂17-Mar-85 1029 CLT
no supper tonite
∂17-Mar-85 1119 NILSSON@SU-SCORE.ARPA Student Prospect
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Mar 85 11:19:41 PST
Date: Sun 17 Mar 85 11:19:31-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Student Prospect
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA, theodorou@SU-SCORE.ARPA
John, Timothy Fernando, an "admittee" for next year, is coming to
look us (CSD) over on Monday, March 25. Dimitris Theodorou, our
student "host" says that Fernando is "dying to see you." If you
are back from France by then, could you spare a half-hour with
him sometime that day? Theodorou is helping to arrange schedules.
-Nils
-------
∂17-Mar-85 1319 @MIT-MC:DAM%OZ@SCRC-RIVERSIDE [AGRE at OZ: NAIQ]
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 17 Mar 85 13:19:48 PST
Received: from MIT-OZ by MIT-MC via Chaosnet; 17 MAR 85 16:18:58 EST
Received: from MIT-JANIS by MIT-OZ via Chaosnet; 17 Mar 85 16:18-EST
Date: Sun, 17 Mar 85 16:17 EST
From: "David A. McAllester" <DAM%OZ@SCRC-RIVERSIDE.ARPA>
Subject: [AGRE at OZ: NAIQ]
To: JMC@SU-AI.ARPA
From: AGRE@MIT-OZ
To: dam@MIT-OZ
Subject: NAIQ
Here's the NAIQ Call for Papers. Do you think you could
pass it on to McCarthy, and anyone else you think would
be worthwhile?
Thanks.
/phil
CALL FOR PAPERS
for the
Network Artificial Intelligence Quarterly
The Network AI Quarterly is an experimental electronic journal concerned
with artificial intelligence. It will be "published" over the network
approximately quarterly; each issue will contain on the order of 10000
words. NAIQ is intended to complement both existing paper journals such
as Artificial Intelligence and Cognitive Science and electronic bulletin
boards such as AIList, combining something of the formality of the
former with something of the timeliness of the latter. The editors of
NAIQ will select submitted articles for publication, and communicate
with the authors about revisions and final preparation of articles. A
more formal refereeing process may be adopted in the future.
A submitted article need only: (1) say something new, (2) relate in some
way to artificial intelligence or cognitive science, (3) be of broad
interest in these fields, and (4) be clear, concise, and well-written.
Submissions may take the form of reports of original research,
theoretical discussions stating a new point of view on a question of
current scientific interest, synthetic surveys of well-defined bodies of
literature, or reasoned commentaries or retrospectives on previously
reported work. Articles should be in the range of 1000 to 5000 words in
length, as appropriate.
NAIQ is an experiment; the editors are open to novel forms of
contributions. However, NAIQ is not an appropriate forum for certain
sorts of material for which there are established electronic media, for
example running discussions, redistributed abstracts, announcements of
events, requests for information, and advertisements.
If you are interested in contributing, please respond to
NAIQ-Editors@MIT-MC. Please indicate what kind of article you would be
interested in writing and when you would plan to have it completed.
∂18-Mar-85 1055 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Mar 85 10:54:17 PST
Date: Mon 18 Mar 85 10:41:15-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
[cwr] the introspective code is under [1,CWR] as:
INTERP
MAP
KEMPE
sorry it took so long but I've been working on my chess stuff
too much.
-------
∂18-Mar-85 1058 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Mar 85 10:58:27 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 18 Mar 85 09:48:05-PST
Date: Mon 18 Mar 85 09:48:36-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting reminder
To: f4@SU-CSLI.ARPA
This will be the last F4 meeting this quarter. The plan for next
quarter is to combine F1, F3, and F4 to talk about representation,
with Jerry Fodor being involved. Stay tuned for further details.
--Bob
---------------
Return-Path: <@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA>
Received: from SU-SCORE.ARPA by SRI-AI.ARPA with TCP; Mon 4 Mar 85 17:21:25-PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Mon 4 Mar 85 16:56:10-PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 4 Mar 85 16:55:20-PST
Date: Mon 4 Mar 85 16:55:26-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
The next F4 meeting will be held on March 18 at 1:15 in the Ventura
Conference Room. We will continue discussing Dick Jeffrey's paper,
concentrating on the final section, "Psychology and Probablity Logic."
-------
-------
∂18-Mar-85 1100 JMC*
Griffiths
∂18-Mar-85 1120 JMC
26 76 58
∂18-Mar-85 1141 RA Prolog Conference
Please call Prof. Jaques Cohen from Brandeis University re: Prolog
Conference.
∂18-Mar-85 1216 SG Prof.Moto-oka / ICOT visitors
To: JMC
CC: SG
[Prof.Moto-oka / Univ. Tokyo]
Do you know Prof.Moto-oka at the University of Tokyo?
He visited Prof.Tom Binford at Stanford last Friday, and sent his kind regards
to you. He will be the chairman at the NSF-JSPS seminar in Japan in June.
[Two visitors from ICOT]
I am happy if you could find time (say, five or ten minutes) to receive greetings
from two researchers at ICOT. They will stay from 2 p.m. to 5 p.m. *this* afternoon.
∂18-Mar-85 1400 JMC*
bill to inference, deposit checks
∂18-Mar-85 1414 SG Thank you / Prof.Moto-oka, ICOT
To: JMC
CC: SG
Thank you for your reply. I will send your regards to Prof.Moto-oka.
I would come to your office *after* I will interview them on their interest.
Shigeki
∂18-Mar-85 1423 selker.pa@Xerox.ARPA [Gunther.pa: Forum: Online Databases]
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 18 Mar 85 14:22:46 PST
Received: from Semillon.ms by ArpaGateway.ms ; 18 MAR 85 13:14:10 PST
Date: 18 Mar 85 10:47 PST
From: selker.pa@XEROX.ARPA
Subject: [Gunther.pa: Forum: Online Databases]
To: JMC@SU-AI.ARPA
cc: selker.pa@XEROX.ARPA
>>CoveringMessage<<
----- Begin Forwarded Messages -----
Date: 14 Mar 85 18:27:03 PST (Thursday)
From: Gunther.pa
Subject: Forum: Online Databases
To: ForumsAtPARC↑.pa, ESForums↑.es, ParcForum↑.wbst
cc: Subhana, "[Ivy]<Forum>Communications.dl":;
Reply-To: Gunther.pa
FORUM
Thursday, March 21, 1985
4:00 p.m. PARC Auditorium
PARC Technical Information Center
presents
"From IRS to IEEE: A Database Menu"
The Technical Information Center(TIC) at PARC has a list of
approximately 800 online databases, which we access using Altos,
Dandelions, portables, and 820s. These databases come from a multitude
of international vendors, in 3 basic flavors: bibliographic, numeric,
and full text.
TIC manipulates the raw output with all the technical tricks we can
think of, to obtain the most readable format for our users' eyes.
However, we still labor under the lack of a proper, universal user
interface, which could relieve us from the burden of consulting reams of
documentation, and keeping a plethora of detail in our minds.
We believe that Francis Bacon, if he were alive today, would be one of
the most enthusiastic users of these databases, which cover much of all
human knowledge. This is a resource pool you might not have used fully
for the benefit of your research project. Our panel presentation will
offer a brief insight into the world of commercial online databases
which includes, among its newest offerings, the full text of many
Internal Revenue Service publications. Of course, most of our technical
databases, such as IEEE/Inspec, are of more perennial interest.
This Forum is OPEN.
Next Forum: "The Robotic Aids Project" by Chuck Buckely
HOST: Neil Gunther (CSL extn: 4401)
Refreshments will be served at 3:45 p.m.
Requests for videotaping should be sent to Mulhern.pa before Tuesday
noon.
----- End Forwarded Messages -----
∂18-Mar-85 2008 BARWISE@SU-CSLI.ARPA Current postdocs
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Mar 85 20:08:10 PST
Date: Mon 18 Mar 85 20:05:33-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Current postdocs
To: Initiators@SU-CSLI.ARPA
We are still in the process of sorting out the postdoc awards. We
have invited King, a philosopher from UCSD who works on anaphora, up
for a visit, among other things. He will be here Wednesday and
Thursday. A number of offers are definite, though, and have gone out.
This message is about the current postdocs. As you know, we had
originally planned on having reappointment be almost automatic, but
the current funding situation precludes that. We did let them
reapply, though. Seven of them have reapplied, and of these two
(Sells and Menzel) have been offered a second year. The others have
been offered half time support, plus a promise of help in attempting
to locate additional support. Of these five, Blair really does not
need more than the half, since he came only in February; Moss has been
offered a job at Michigan, and the STanford math dept has offered to
have him teach half time; Schacht has been offered and has accepted a
job in N.Y. This leaves Rooth and Zalta who may need additional
support.
One initiator has offered to use $3500 of his current funds to help
support Rooth. I wonder if any of the rest of you would want and be
able to help out with additional funds for either of these men, or if
you could help them find teaching or other support.
Drop me a note if you can help. I feel we should try hard to support
these researchers next year if they want to stay.
At this stage, these postdocs have not been informed of the decisions,
since they might be considered still in the running for any positions
that our first candidates turn down.
Jon
-------
∂19-Mar-85 0200 JMC*
Griffiths
∂19-Mar-85 0843 BRONSTEIN@SU-SCORE.ARPA re: Stanford Computer Scientist sues DOD! (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 85 08:43:04 PST
Date: Tue 19 Mar 85 08:42:53-PST
From: Alexandre Bronstein <BRONSTEIN@SU-SCORE.ARPA>
Subject: re: Stanford Computer Scientist sues DOD! (from SAIL's BBOARD)
To: jmc@SU-AI.ARPA
cc: su-bboards@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 18 Mar 85 23:12:00-PST
Well, as you put it, it's all only a GAME. We might as well let computers play
it for us.
See you all at the next big-mushroom party.
Alex -oo- (over and out)
-------
∂19-Mar-85 1116 TULEY@SU-SCORE.ARPA Express Package
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 85 11:16:43 PST
Date: Tue 19 Mar 85 11:16:20-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: Express Package
To: jmc@SU-AI.ARPA
cc: ra@SU-AI.ARPA
Hello,
An Express Package was just delivered for John McCarthy - I put it in your
box.
Kim
-------
∂19-Mar-85 1135 RA express mail
Express mail for you from Centre Mondial on your desk.
∂19-Mar-85 1352 gnelson@decwrl.ARPA re: Industrial Lecturer
Received: from DECWRL.ARPA by SU-AI.ARPA with TCP; 19 Mar 85 13:52:27 PST
Received: from magic.ARPA by decwrl.ARPA (4.22.01/4.7.34)
id AA02691; Tue, 19 Mar 85 13:51:37 pst
Received: by magic.ARPA (4.22.01/4.7.34)
id AA16853; Tue, 19 Mar 85 13:51:22 pst
From: gnelson@decwrl.ARPA (Greg Nelson)
Message-Id: <8503192151.AA16853@magic.ARPA>
Date: 19 Mar 1985 1351-PST (Tuesday)
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: gnelson@decwrl.ARPA
Subject: re: Industrial Lecturer
In-Reply-To: Your message of 17 Mar 85 0019 PST.
<8503170820.AA07774@decwrl.ARPA>
Thanks. I expect I will send you an application in the fall.
Greg
∂19-Mar-85 1417 RA Academic Senate ballot
Nils Nilsson would like to know whether you want to serve again
as the department rep. at the academic senate. Please let him know.
Thanks.
∂19-Mar-85 1737 @SU-SCORE.ARPA:avg@diablo re: Stanford Computer Scientist sues DOD!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 85 17:36:50 PST
Received: from diablo.ARPA (SU-AIMVAX.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Tue 19 Mar 85 17:34:56-PST
Date: Tue, 19 Mar 85 17:34:43 pst
From: Allen VanGelder <avg@diablo>
Subject: re: Stanford Computer Scientist sues DOD!
To: JMC@Sail, su-bboards@diablo
I do not think that protesting incorrect government actions does
damage, as JMC states. In our pluralistic society, when people
disagree they tend to speak out. The USSR cannot possibly factor
all the conflicting noise emanating from our citizens into an
estimate of the likelihood that they can nuke us without getting
nuked back. Even if they thought there was a 90% chance that we
would not retaliate, the remaining 10% is an adequate deterrent.
Why? Because the USSR is not desperate and their leaders are not
insane. (I am no expert, but it seems to me that their bureaucratic
power system makes the ascendancy of a madman but less likely than
our mass-appeal-through-TV system.)
"I disagree with what you say, but will defend to the death your
right to say it." Even if a protest is ill-conceived, the response
should be to rebut it, not to silence it.
∂19-Mar-85 1853 avg@diablo Re: Silencing Johnson?
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 19 Mar 85 18:53:37 PST
Date: Tue, 19 Mar 85 18:53:30 pst
From: Allen VanGelder <avg@diablo>
Subject: Re: Silencing Johnson?
To: JMC@SU-AI.ARPA
Whether you intended it or not, I think a lot of people would interpret
a statement that "The higher the court it reaches, the more damage
it does" to have an implicit "and therefore he should stop" following it.
So what if our protesters are inelastic with respect to USSR armament
levels? Surely their objective function is not maximizing protest.
I contend that their armament level is inelastic with respect to our
protest level -- i.e., they will not reduce armaments if we suddenly
stop protesting and switch to saying "Bad Russians!"
I agree with you (I think) that USSR is our enemy, at least adversary,
for the foreseeable future. But I don't think they will start a
nuclear war, because, as I said, they are not desperate, and not insane.
LOWC is not a defense against insanity, anyway.
The Russians will take whatever, they can get, and would certainly take
Europe if they thought they could. I think that basing missiles in
Europe under Europeans' control is a good way of guaranteeing that they
KNOW they can't take Europe. Since we let the Shiites run us out of
Lebanon, nobody is going to count on US to defend Europe.
True, putting missiles in Europe involves danger, but I think it
provides an actual deterrent to an actual threat. I don't think LOWC
reduces the chance the Russians will attack us and I think that chance
is near zero anyway, so the added danger is not offset in this case.
Finally, I don't distinguish protests based on their medium. I doubt
Johnson would file suit if he favored LOWC, even if he thought it was
illegal. The original civil rights protests (of the modern era) were
the freedom riders that tried to get the U.S. constitution
enforced in the South. Whether people claim something is against the
law or claim the law is bad makes little substantial difference.
∂20-Mar-85 0738 @SU-SCORE.ARPA:AI.PETRIE@MCC.ARPA Emycin
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 07:38:14 PST
Received: from MCC.ARPA by SU-SCORE.ARPA with TCP; Wed 20 Mar 85 07:37:58-PST
Date: Wed 20 Mar 85 09:37:15-CST
From: AI.PETRIE@MCC.ARPA
Subject: Emycin
To: jmc@SU-SCORE.ARPA
For your possible interest, here is a note I composed
about a limitation of Emycin:
**************************************
TO: Distribution
FROM: Charles Petrie
DATE: Mar 14, 1985
SUBJECT: Emycin Default Reasoning: CF Propagation
If an assertion in Emycin (such assertions generally being that
some parameter has some value) is used as a premise in a rule and later
its CF changes, the change is not propagated back to the earlier rule
use. This has been demonstrated with a simple experiment.
The Emycin predicate "MIGHTBE" is true if there is no evidence against
the subject assertion. This predicate could obviously be used for
default reasoning with the following two rule scheme:
If P and (MIGHTBE R), then Q.
If S then R.
In this simple example, CFs are either 1 or 0. Then if the goal is Q,
and P is believed, then Q will be believed if, there is no evidence
disconfirming the belief of R. Emycin will attempt to prove R when the
first rule is used. If the second rule is a consequent rule (backward
chaining), it will be used in an attempt to prove R. Emycin does have a
check for circular reasoning. If the second rule is a consequent rule,
and S can be proved from Q, then the circularity will be detected.
Emycin's behavior is to announce the circularity, not conclude anything
about R, and conclude Q (CF = 1).
If the second rule is an antecedent rule, the failure of Emycin to
propagate CFs when they change is revealed. The closest approximation
to volunteered information in Emycin is INITIALDATA. These are
parameters about which the user will be asked at the beginning of a
consultation before any proof attempt is made. (Presumably, a simple
check for any emergency condition could be asked at the beginning of all
consultations, although this would be a nuisance.) If the second rule
in the above scheme is an antecedent rule, and S is an answer that is
obtained in response to an INITIALDATA question, then R will be
concluded before the first rule is used in an attempt to conclude Q.
The first rule will then fail, as it should.
However, if S follows from Q, or is Q, and the second rule is an
antecedent rule, then no circularity is detected. The second rule will fire
only after the first rule is used to conclude Q. This does not
invalidate the conclusion of Q because the new conclusion of R does not
cause the first rule to be re-evaluated. This causes an interesting
phenomenon in debugging. If one objects to the conclusion of Q, one is
eventually asked if clause two of the premise of the first rule should
have failed. At that point, clause two asserts that there is no
evidence that R is the case. When one replies that the clause should
indeed have failed, Emycin simply notes that it believes R is the case
(as a result of firing the second rule if you inquire further) and that
you apparently have a problem with the first rule. The CF of 1 for R
has been propagated forward, but not backward, and the Emycin debugger
is not aware of the discrepancy.
Emycin does not allow the user to volunteer information. If unusual
conditions are to be allowed for, the user must be queried about their
possibility in every consultation. Thus, antecedent rules (forward
chaining) have limited use for default reasoning. This capability is
further limited by the failure of Emycin to propagate the results of
such firings backwards.
Charles
-------
∂20-Mar-85 1114 JJW@SU-AI.ARPA Results of name contest
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 11:14:41 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Wed, 20 Mar 85 11:14:17 pst
Date: 20 Mar 85 1113 PST
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: Results of name contest
To: csdfacilities@SU-PESCADERO.ARPA
Cc: Nilsson@SU-SCORE.ARPA
As of the official closing time of the name contest for the new
DECsystem-20, the results are as follows:
Votes Name
6 Pacific
6 Sushi
4 Mammoth
4 Redwood
3 Anarchy
3 Chiron
3 Six
3 Smore
Others received fewer than 3 votes. I think "Pacific" is a much better
choice than Sushi. (Jeff, how serious was your suggestion of that name?)
It has a slight conflict with "Pacifica", one of the HPP Dolphins, but I
don't think we should let that get in the way.
Any objection to "Pacific"? Please reply to the list since I will be gone
for the next few days, until probably after an official name is needed.
∂20-Mar-85 1144 RA visit by Barry Jones (Australia)
Barry Jones, The Australian minister of science will come to see
you on April 22 (Monday). We set 10:00 as a tentative time, if
this is inconvenient, please let me know a better time for you. I put
it in your calendar.
∂20-Mar-85 1236 SSO.OWICKI@SU-SIERRA.ARPA Faculty candidate
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 12:35:46 PST
Date: Wed 20 Mar 85 12:35:57-PST
From: Susan Owicki <SSO.OWICKI@SU-SIERRA.ARPA>
Subject: Faculty candidate
To: jmc@SU-AI.ARPA
We have a faculty candidate coming on Thursday March 28 who is investigating
architectures for prolog machines. His abstract follows. Are you interested
in talking with him?
Sue
-------
∂20-Mar-85 1236 SSO.OWICKI@SU-SIERRA.ARPA abstract for Kale
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 12:36:32 PST
Date: Wed 20 Mar 85 12:36:51-PST
From: Susan Owicki <SSO.OWICKI@SU-SIERRA.ARPA>
Subject: abstract for Kale
To: jmc@SU-AI.ARPA
Parallel Architectures for Problem Solving
L.V. Kale\
ABSTRACT
The problem of designing parallel architectures and execution
methods for solving large computational problems is investigated.
Logic Programming is chosen as a language to specify the
computation because it is seen as a language that is conceptually
simple as well as amenable to parallel interpretation.
The REDUCE-OR tree is introduced as
a view of computation that is more suitable for capturing
parallelism than the AND-OR tree.
A process model is proposed that
retains both AND and OR parallelism that is inherent in the
program. It permits a variety of control strategies.
A general model is developed that includes the essential components of any
parallel Prolog implementation.
It provides a uniform framework for analyzing tradeoffs and issues
pertaining to performance.
A specific class of multibus architectures is proposed and
investigated. Parameters of the architectures of this class are
identified, and alternatives such as different topologies
are analyzed from the point of view of performance.
-------
∂20-Mar-85 1334 RA Invitation to participate
Prof. Michael Rabins, chairman of Mechanical Engineering in Wain University in
Detroit and PI on a grant from NSF to American Society of Mechanical
Engineering, called re organizing NSF workshop which will deal
with Design Theory and Methodology to support a new project at NSF. One
element of the project is the use of AI in design theory. He would like
you to participate not only in the workshop but also in the steering
committee. The first meeting of the steering committee will be in Washington
DC on Friday, April 5. Your expenses will be paid. You can call him at
home on Sunday night (313) 851 5530, or Monday (March 25) at his
office (313) 577 3843.
∂20-Mar-85 1544 JFODOR@SU-CSLI.ARPA DC escapade
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 15:44:30 PST
Date: Wed 20 Mar 85 15:40:24-PST
From: JERRY FODOR <JFODOR@SU-CSLI.ARPA>
Subject: DC escapade
To: research@SU-CSLI.ARPA
Dear Mitch:
On the off chance that you're low on light reading, here is the text (rough
draft) of what I'm going to say to NSF. Forewarned is forearmed. Be
prepared. Don't take any wooden nickels.
Text commences:
@Center(@B[A PRESENTATION TO THE NATIONAL SCIENCE FOUNDATION
WORKSHOP ON REPRESENTATION AND COGNITION]
Jerry A. Fodor
M.I.T.)
Like the previous speaker, John Perry, I am a philosopher by
training and occasionally, by inclination. Philosophers, as
many of you may know, are sensitive plants. We are prey to a
variety of worries that appear to be specific to our profession.
Some of us fear, for example, that there is something fundamentally
unsound about tables and chairs; that perhaps we shall run out of
prime numbers or afterimages; that our bodies aren't really there
or that our minds aren't; stuff like that. I am aware that, to
our colleagues and our spouses, these anxieties often seem
extravagant. But when they're added to the usual concerns about
getting tenure, I can assure you that they constitute a heavy load to
bear.
The reason I am bothering you with these markedly
uninterdisciplinary reflections is this. Every now and then some
merely philosophical worry turns out to be real and pressing. It
thereby ceases to be @i(merely) philosophical and presents
itself as a matter of general concern. I think that this is now
happening at the core of cognitive science and that it has
implications for the organization and administration of cognitive
science research. Moreover, I sense a rather widespread -if
implicit- consensus that something of this sort is true. I
propose, in the next less than half an hour, to try to make this
consensus more articulate.
About two hundred years ago, philosophers began to be depressed
by the following thought: that problems about the cognitive mind
and problems about symbolic representation would have to be solved
@i(together). This thought is depressing because problems about
mind and problems about representation are both very hard, and
when you've got one very hard problem to solve the last thing you
need is another one. In fact, it's so depressing that the fear
of having to face it has made behaviorists out of generations of
philosophers. And, of course, psychologists.
Depressing or otherwise, however, it's extremely plausible that the
relation between cognition and representation is intrinsic. There
are lots of ways of making this point, here's one: What
philosophers call 'intensionality' -the property, to put it
briefly, of @i(aboutness)- bifurcates the world. There are, as
far as we know, two @i(and only two) sorts of things in the whole
universe that have it, these being @i(mental states) and
@i(symbols). So, suppose, for example, that Jon -Jon Barwise, as
it might be- believes that Turing is up again. (Turing is a
disaster prone DEC 20 that lives, and sometimes works, at
Stanford). Then Jon's belief has a certain propositional content;
viz. it has the content @i(that Turing is up again). In virtue of
having that content, Jon's belief is about something (viz. it's
about Turing's current condition). And in virtue of being about
Turing's condition, Jon's belief is semantically evaluable; viz.
Jon's belief is true on the off-chance that Turing is working,
and false otherwise.
Much the same sort of thing, however can be said about
@i(symbols) -forms of words, as it might be. Consider, in
particular, the English form of words "Turing is up again!" It
looks as though that sentence -or perhaps that sentence as
employed in certain contexts- has a propositional content (it
expresses the proposition that Turing is up again); and it's
about something in virtue of having the content that it does;
and it's true or false depending on how things are with what it's
about; viz on how things are with Turing.
Notoriously, it's hard to say all this just right; that, in fact,
is one of the things that philosophers worry about. But the way
I've just said it should be good enough to make the point that
I'm urging. Nothing @i(remotely like) this story about mental
states and symbols applies to any of the rest of the created
universe. There's nothing that trees, or prime numbers, or
protons, or tables and chairs, or spouses are about; they have no
propositional content; and they are not @i(semantically)
evaluable, however useful they may be in other respects. Well,
it's hard to believe that this is all just accidental. And if
it's not, it's hard to see how whatever theory works for symbols
could fail to connect pretty closely with whatever theory works
for mind. It looks as though the mental and the symbolic form a
@i(natural theoretical domain) and are both going to have to
shelter under much the same umbrella.
So much for a quick glance at why it might seem @i(plausible)
that we need a single theory for cognition and representation;
now for a glance at why it might seem sad.
If you look at early attempts to construct the required covering
theory, the situation doesn't seem so bad. Take somebody
like Hume, for example. Here's Hume's story about how you connect
the theory of cognition with the theory of representation: Minds,
he says, are populated by a class of particulars called
'Ideas'. Ideas come in roughly three kinds: sensations,
perceptions and thoughts. (I'm not actually being faithful to
Hume's terminology, which tends to be imperspicuous.) Now, seen
from the psychologist's point of view, the interesting fact about
Ideas is that they enter into relations of association.
Association is a causal relation in virtue of which one Idea
conjures up another; Hume describes it as the mental analog to
gravitational attraction. So, then, once the outside world starts
things up by presenting a sensation to the mind, association can
keep things going by calling up perceptions and thoughts to keep
the sensation company. Hume assumes that the paradigmatic
cognitive achievements -specifically, thinking and what modern
psychologists call 'perceptual integration'- are instances of
this sort of chaining, so Hume's theory of cognitive processes
reduces exhaustively to his theory of association. A fact that he
is pleased with and advertises frequently.
Seen from the semanticist's point of view, however, the
interesting thing about Ideas is that they are @i(symbols). Give
or take a little, Hume supposes that Ideas are @i(images), and
that they represent what they resemble. Notice that Hume really
does @i(need) some such semantical assumption because he has to
answer the question 'How could the associative chaining of Ideas
constitute @i(thinking)?' In particular, chains of thought are
sequences of mental states; and, as we've seen, @i(mental states
typically have intentional properties; they're about how the
world is). So, if chains of thought are chains of Ideas, then
Ideas must somehow have intentional properties too; Ideas too
must somehow manage to be about how the world is. So Hume makes
this characteristically brilliant move: according to Hume, Ideas
have intentional properties @i(because they are symbols); the
semantically evaluable thus @i(reduces to) the symbolic; the
resemblance theory of representation @i(explains) the
intentionality of cognition.
To summarize: by the end of the 18th Century, more or
less, we have the Humean synthesis in place: the connection
between the cognitive and the representational is explained by
the hypothesis that mental processes are operations defined on
mental symbols.
We now skip a couple of hundred years during which nothing of
significance transpires. And arrive at The Modern Era.
Here's what happened in The Modern Era: First, the Humean
Synthesis broke down. Second, its breakdown came to be widely
noticed. Third, the fact that the Humean Synthesis had broken
down -and that no adequate replacement was in view- began to
present an impediment to empirical research in a variety of
disciplines from, say, linguistics to computer science to AI to
cognitive psychology to neuropsychology to the philosophy of
mind. The third of these events is patently a cause for
interdisciplinary concern. It constitutes, in my view, something
of a scientific crisis but also an unparalleled research
opportunity. And it's what brings us here today.
The crisis arises because only half of the Humean Synthesis has
proved tenable. The idea that mental processes are defined on
symbols underlies all the best modern work on cognition; in the
current state of the art, it's simply irresistable. But the idea
that mental symbols are images now appears to be subject
to insuperable objections. So we are in the position of having a
representational theory of the mind without having a theory of
mental representation. This is not a stable position; something
has to be done.
I expect that much of this part of the story is familiar to most
of you; but let me try to put it in synoptic form. We are, I
think, badly in need of perspective.
There may be mental images, and it may be important that there
are some. (I'll return to this presently; it's one of a
budget of empirical issues in psychology that our inadequte
understanding of representation makes it hard for us to work on).
But, however that goes, Hume's hope that we might solve the
problem of mental representation at a stroke by identifying the
intentional with the imagistic is clearly doomed. For two
reasons. First, if you're going to identify thinking with having
causal sequences of mental symbols run through your head, then
THE VOCABULARY THAT THESE SYMBOLS MAKE AVAILABLE MUST BE RICH
ENOUGH TO EXPRESS ALL THE CONTENTS OF THOUGHTS. If, for example,
thinking that Turing isn't up is having a negative thought, and
if having a negative thought is entertaining a mental symbol that
expresses a negative proposition, then MENTAL SYMBOLS MUST BE THE
SORTS OF THINGS THAT CAN EXPRESS NEGATION. It is, however, very
hard to express negation with an image (what does a picture of
Turing's not being up look like?) Similarly with hypothetical
propositions, and quantified propositions... and so forth. Images
don't have the right logical syntax to do what Hume wanted them
to; viz. provide the format in which our thoughts are couched.
And, second, even if we did think exclusively in images, Hume's
idea that the semantics of images reduces to resemblance won't
work. A picture can perfectly well resemble -indeed, it can
resemble as closely as you like- something that it's not a
picture @i(of). In consequence, the image theory of thought
wouldn't explain the intentionality of thought @i(even if it were
true). A line of philosophers from Wittgenstein to Nelson Goodman
have made a living off this point, and I think that we had better
let them have it.
Anyhow, if a language is needed that's rich enough to couch
thoughts in -rich enough to provide the arrays of symbols over
which cognitive processes are supposed to be defined- we've now
got better candidates than images. We've got 'formal' languages
(from logic) and programming languages (from computer science).
For that matter, we've got @i(natural) languages (for that small
and eccentric band of theorists who think that we think in
English.) The thing about these sorts of symbol systems is that
they provide formal vehicles -logico-syntactical structures-
capable of expressing very fancy propositions indeed; symbolic
structures in which you get not just negative operators, but
modal ones too; to say nothing of variables together with
quanitifiers to bind them, psychological verbs with sentences
subordinated to them; tense relations of Baroque complexity; and
adjectival and adverbal modifiers piled up until the cows come
home. The closer you get to natural languages, indeed, the closer
you get to representational systems in which one can say whatever
one can think. Not surprisingly, of course; natural langauges are
@i(for) saying what one thinks.
So what is there to be depressed about? It seems that we actually
know some things that Hume did not. On the one hand, we have
systems of logico-syntactical objects asymptotically rich enough
to provide the vehicles for thought; and, on the other, we have
the computer as a model of the mechanical manipulation of these
logico-syntactical objects. We can therefore replace Hume's story
about images associatively interconnected with an updated story
about logico-syntactic forms subsumed by computational
operations. We thus have a theory of cognitive processes
recognizably in Hume's spirit, but vastly richer in the kinds of
mental lives it can describe.
Take linguistics, for example. Here is how we do linguistics: we
specify -axiomatically- a formal language (a 'level of linguisic
description', to use the technical jargon.) This formal language
includes a (typically infinite) array of well-formed formulas,
together with their intended semantic interpretations. (So, for
example, the language might consist of an infinite set of
labelled tree structures, specified in a vocabulary that
includes the symbols 'NP', 'VP'.... etc. together with salient
geometrical relations like domination, concatenation, and so
forth. The intended interpretation of this language is specified
by saying such things as that the symbol 'NP' denotes the
property of being a nounphrase, the symbol 'VP' designates the
property of being a verb phrase...etc, and that if, in a tree
structure, a node A dominates a node B, then the semantic
interpretation of this geometrical configuration is that B is a
constituent of type A. (I am putting this rather loosely, but I
take it that the idea is familiar.)
If all this goes right, it gives us a domain of logico-syntactic
objects which, under their intended interpretations, are
representations of, say, English sentences and over which we can
specify a population of mental -specifically psycholinguistic-
processes. So we can, and do, identify parsing with the
construction of such trees from input wave-forms.
Correspondingly, language learning, at the syntactic level, turns
out to be the internalization of an axiomatization of a system of
such tree structures appropriate to describe the sentences of
the language learned. Speech production is conceptualized as the
integration of such tree structures and their transformation into
acoustic wave-forms...and so forth.
So far, this doesn't sound much like a crisis. No doubt there's
disagreement on lots of details (and on lots of nondetails, for that
matter). But this sort of picture has done good work for us
recently across a whole spectrum of disciplines. Even those who
are pessimstic about how far it can ultimately be pushed don't
expect to have to give it up tomorrow.
So then what's the problem? The problem is that, when we
construct these sorts of computational theories in psychology,
linguistics and Ai, we are working with notions that we don't
really understand. And this chicken is now coming home to roost;
what we don't understand about the foundations of computation
theory is starting to get in the way of our research.
To take one case -not a small one-: It's intrinsic to this sort of
theorizing that one thinks of the objects that get manipulated by
mental processes as 'syntactical' or 'formal' and that one thinks
of the mental processes themselves as 'computational' But we
don't really know what that means (just as Hume didn't, really,
have any @i[general] account of what it is for somethng to be an
image or a process of association.) Battles about this
keep breaking into the press. For example: are the operations
that 'transducers' perform in perception supposed to count as
computations within the meaning of the act? If not, why not? If
so, what @i(wouldn't) count as computation? A lot of the
recent sniping back and forth between 'information flow
psychologists' and 'ecological Realists' of the Gibsonian
persuasion has turned on this sort of issue. It doesn't look to
be fully resolvable short of a theory of computation broad enough
to say just what the presumed analogy between minds and computers
is actually supposed to be. And yet, as many of you will
recognize, how you jump on this distiction determines your
research priorities and tactics. You approach the experimental
investigation of perception differently if you're thinking of
organisms as transducers than you do if you're thinking of
organisms as inference machines.
Or consider another, closely related point. I said that as the
languages available for use as systems of mental representation
get closer in their expressive power to natural languages, they
also get closer to being plausible as vehicles for thought. But
this has a sinister side: As formal languages get more and more
natural WE MORE AND MORE LOSE OUR GRIP ON THEIR SEMANTICS. There
is no worked out (to say nothing of workable) specification of
the 'intended interpretations' of the well-formed formulas of
English. And a lot of peole -especially around Stanford- are
worrying that the reasons that natural language is so good at
expressing thought are @i(essentially) connected with ways in
which natural languages @i(differ) from the sorts of formalisms
traditionally used in mathematics and computer science, these
latter being the only sorts of rich symbolic systems about whose
semantics we now have much of a clue. Indexicality has loomed
large, of late, in discussions on both Coasts. I know just enough
about this to be convinced that, if that's where the problem
lies, then it is a @i(VERY HARD PROBLEM).
But there's worse; it's not just that we don't know how to
specify the intended interpretations of formalisms that look rich
enough to serve as 'languages of thought'; it's also that we
don't know what it is for something to @i(be) the 'intended'
interpretation of such a formalism. This is where it really hurts
that Hume was wrong about resemblance. For whereas Hume could say
'what it is for a thought to be about a chair is for the thought
to resemble a chair', we can't say that and @i(we don't know what
to say instead). There is an intuition that thoughts are about
the world in virtue of the way that the thinker is causally
connected to the world; that -to put it about as misleading as
possible- semantics somehow reduces to robotics. But nobody knows
how this intuition is supposed to be cashed and the problems look
formidable. The discussion of these issue in the cognitive
science literature thus far is largely a disaster area, obscured
by a pervasive confusion between semantics and logical syntax,
and littered with the corpses of dead theories.
This is, to put it mildly, no joke; to see that it is no joke,
bear in mind that saying that thoughts have semantical properties
-that they are about the world- is just a way of saying that
thoughts contain 'information' about the world. The
@i(fundamental) idea of information flow psychology is that
organisms extract information from their environments; that their
mental processes elaborate this information; and that their
behavior is determined by the information that mental processing
makes available. It is precisely this processing of information
that computational psychology is supposed to explain and
artificial intelligence is supposed to simulate. @i(And we don't
know what any of this means because we don't know what
information is.)
How much of this is just philosophy? What's important about the
current crisis of theory is that its effects are now felt broadly
throughout the information sciences. I've already mentioned the
problem of imagistic thought. It's not unreasonable, given the
experimental work by Shepard, Kosslyn, Fink, Pinker and others to
suppose that some mental representation is iconic; and it's also
not unreasonable to suppose that the iconicity of some mental
representations may be important to understanding the success of
some sorts of problem solving (see Johnson-Laird; but also Lance
Rips). That's all fine, but then the trouble starts: when you get
past the resemblance theory of reference (which, I take it,
nobody now believes) what, precisely, does the claim that mental
representation is -or, for that matter, isn't- iconic amount to?
How, precisely, are the experiments supposed to bear on that
claim (and, if the present experiments don't bear, what
experiments can we do that would?) What about John Anderson's
surprising suggestion that you can't @i(even in principle) have
empirical evidence that decides this sort of question? Suppose I
want to build a machine that's smart because it manipulates (not
mental sentences but) mental models? How do I go about even
@i(thinking) about such a machine if I don't know either what a
mental sentence or a mental model is supposed to be?
Or take another case fresh from the recent empirical literature.
There's some fascinating work by Neil Cohen that's supposed to
exhibit a pathological dissociation of knowledge of skills from
knowledge of facts. So, for example, Cohen reports the following
sort of results. If you take normal subjects and train them, over
a series of sessions, on a hard task like reading backward text,
you find two partially independent learning effects; on the one
hand, the subjects get progressively better at the task, whether
their stimulus materials be new or old items; but also, there's a
differential facilitation of materials previously seen. Thus, if
you've had a number of sessions of learning to read backwards
and I give you the stimulus 'sdrawkcab', you will, of course, do
better than a subject who has had no previous training in the
task. But also, if you've seen 'sdrawdcab' on earlier trials,
you'll do better on that item than you would on matched items
that you hadn't seen before. So it looks like there are two
learning effects: one that's item specific and one that's not.
This isn't, in itself, very surprising; but what @i(is) striking
is the existence of brain damaged populations where these effects
dissociate; these subjects exhibit the normal improvement of the
skill over practice trials, but @i(not the normal effect of
previous exposure to specific items). It's as though the subject
could learn @i(how) to read backwards, but can't learn @i(that)
'backwards' spelled backwards looks like 'sdrawkcab'. These are,
interestingly enough, the same sorts of subjects who, though they
exhibit serious short term memory deficits for names, faces,
events and the like, are apparently able to perform quite
normally on learning to solve the Tower of Hanoi problem. In the
extreme case, their learning of this problem is perfectly normal,
but they have no knowledge of having learned it. With practice,
the subject achieves essentially error-free performance on the
task; but if queried, he'll tell you that he has never seen
puzzle before, that he is behaving at random, and that his
solutions are accidental.
I really @i(do) think that's fascinating; but now, unfortunately,
the argument comes to a screeching halt for want of some
foundational theory. For, how shall we understand Cohen's
discovery in computational terms? Well, one possibility -to
which, I belive, Cohen is himself attracted- is that the
pathological population can learn 'proceedural' but not
'declarative' information. Fine, but what does @i(that)
distinction come to? If you ask a computer type, he's likely to
say that it's a @i(syntactic) distinction, analogous to the
difference between imperative and declarative
@i(sentences). But it's hard to see how that could be the heart
of the matter since, clearly, you can encode what's intuitively
declarative information in syntactically imperative form.
(Indeed, if you're into production systems, you encode
@i[everything] in imperative form, leaving yourself with no
procedural/declarative distinction at all at the level of
syntax). Or, if you ask a philosopher about Cohen's data, he'll
perhaps remind you of Ryle's distinction between 'knowing how'
and 'knowing that'. But if you ask him to tell you what @i(that)
distinction comes to, I promise that he won't be able to; not, at
least, if what you're wanting is the kind of answer that can be
formalized to provides a domain for an algorithm. Which is
presumably exactly what computational psychologists @i(do) want.
I hope I've made it clear that the problem isn't just that we don't
have a good theoretical vocabulary to report our data in; it's
that the best theory of the cognitive mind going, the
representational/ computational theory, is based on a group of
notions -information, aboutness, syntax, representation,
computation, procedure, data structure, and so forth- that are
largely unarticulated. In consequence, the computational story
about the mind isn't doing for us the sort of jobs that one's
best theory is supposed to do: guiding research, rationalizing
the investigative undertaking, and making the empirical data
cohere. Cohen has, as things now stand, these lovely findings;
and he has the computer metaphor. His problem is that his
metaphor, insofar as it is @i(just) a metaphor, doesn't engage
his data. What he needs to make sense of his empirical findings
is not a metaphor but a worked out notion of computation. He's
not the only one.
As John Perry rightly remarked, it doesn't matter if one's best
science is philosophically disreputable. On the contrary, it's
often a sign of progress since developing empirical theories are
always more or less inarticulate. And, anyhow, it's amazing how
much disrepute philosophers can learn to live with. But it
@i(does) matter when your best theories fail to organize your
best research. That's a crisis; and that's what we've got.
So much for the current causes of discontent. A couple of words
on the bright side, and a couple of administrative remarks, and
I'll be done.
First I don't mean to begin to suggest that the work on
understanding intelligence -artifical and/or natural- has got to
wait upon the solution of the foundational problems about
computation and representation. Take a case from my own
interests. I care a lot these days about questions of 'mental
architecture'; questions that concern the restrictions on
information flow between cognitive systems. (This is the area in
which the so-called 'modularity thesis' operates). This research,
like most of cognitive science, is relentlessly
interdisciplinary; you can't, for example, ask how much
contextual information is available to parsing unless you have
some idea of what parsing is; hence some idea of how the recent
psycholinguistics is shaping up. But of course you @i(can) ask it
without having a general account of the nature of information.
Such an account would certainly be useful in theory, but -thank
Heaven- it's not prerequisite to practice. It is important to
realize, however, that doing one's science this way is like
living on credit cards. Comes the end of the month, somebody has
to pay the bill. Sooner or later we're going to have to say what
it is that flows when information does.
Second, though sooner or later we have to have a theory of
representation, we perhaps don't need a theory that works for
the @i(general) case. What we need, if we are to understand and
create intelligent systems, is insight into the character of
those symbolic structures -mental representations- that mediate
cognitive processes. It may be that this means a completely
general theory of representation (one that works not just minds
but also for pictures, say, and for the harbingers of Spring);
but also it may not. Unlike such broken vessels as 'semiotics'
and 'general semantics' we can afford to start out neutral on
that issue. The prospects for constructing a theory of mental
representation are, to this extent, better than the prospects for
constructing a theory of representation at large. This is one
reason why it is absolutely essential that the foundational
work should proceed in tandem with detailed empirical studies of
cognitive and linguistic processes. We come to understand the
design specifications for a theory of information as we come to
know what representational capacities intelligent informational
processing actually does demand. In my view, that is the very
most promising direction for research to take in the immediate
future.
So here's the Fodor Plan for the development of a cognitive
science. One team starts on roughly the semantic end with the
problem of understanding information, computation and
representation. The other team starts on roughly the
psychological end with the problem of understanding mental
processes and states. If all goes well, they converge on a theory
of mental representation and there is light at both ends of the
tunnel. Individual players are encouraged to change teams
frequently in order to keep alert and infrmed. I am, by the way,
entirely serious about this proposal. If I had the responsiblity
to organize the next couple of decades of research in cognitive
science, that is how I would do it.
Third and last and last of the substantive points: If it's true
that the deep questions are getting harder to avoid, it's
equally true that the chances for answering them seem to be
improving. If we still haven't bettered Hume's idea that mental
processes are intentional because they're defined on mental
symbols, at least we have a vastly larger intellectual technology
than he did to work this idea out with. We have learned a lot
about symbol systems and their uses since the Eighteenth century.
The trouble is that the available information is scattered
through a variety of traditional disciplines. Nobody knows enough
-enough linguistics, enough computer science, enough AI, enough
psychology, enough recursion theory, enough formal semantics,
enough logic and enough neuropsychology, for starters- to do the
research that now needs to be done. I think this is going to
have to be a joint undertaking; a lot of people who are used to
working alone are now going to have to learn to work together.
I close with an organizational remark, based on the last ten
years' experience in trying to get this sort of interdisciplinary
work off the ground. Conferences aren't how to do it.
Conferences help with interdisciplinary consciousness raising,
but they are not, in and of themselves, vehicles of scientific
progress. What's needed, in my view, is the construction of
standing research environments that will permit sustained
interaction between specialists with quite different academic
backgrounds; and of pedagogical environments that will permit
young scientists to acquire mixes of competences not even
contemplated until quite recently. It goes without saying that
this cuts across traditional academic affiliations and raises
serious administrative problems. For example, it implies a
funding structure for cognitive science (singular) that is less
rigidly target oriented than NSF funding in the cognitive
sciences (plural) has thus far been. Even the organization of
peer review is problematic when the object of the exercise is
precisely to create new kinds of expertise and bring it to focus
upon new kinds of problems. Where, to put it bluntly, do you find
the peers to do the reviews?
So the administrative and the scientific problems are both hard;
and, too, it's hard admitting that the problems have maybe
started to outstrip one's training. Nevertheless, it seems to me
it's time to get the revolution started. Two hundred years is too
long to be depressed. I think, in fact, that there's a lot of
interesting philosophy and science and technology for us to do
in this field; if not literally tomorrow, than anyhow quite soon.
And even if we don't get to do it, we can create the
organizational framework in which our graduate students will.
This is, insofar as we care about the advancement of the
scientific enterprise, not just our opportunity but also our
obligation.∧
-------
∂20-Mar-85 1608 HEDGES@SU-SCORE.ARPA CCS 224 AI Seminar
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 16:07:54 PST
Date: Wed 20 Mar 85 15:55:08-PST
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: CCS 224 AI Seminar
To: Pentland@SRI-AI.ARPA, TW@SU-AI.ARPA, Grosz@SRI-AI.ARPA, Fikes@USC-ECL.ARPA,
JMC@SU-AI.ARPA
cc: hedges@SU-SCORE.ARPA
CS 224 ARTIFICIAL INTELLIGENCE SEMINAR
THURSDAY 11:00 am -- 12:15 pm
(one unit)
Nils Nilsson, Organizer
(Nilsson@score, 497-9745, sec'y: Karen Hedges--Hedges@score)
All classes will be held in Skilling Auditorium and will be televised.
Please let Nils know if visual aids other than overhead projector will
be needed. Speakers may assume that the audience has some familiarity
with AI since CS223 (the AI course) is a prerequisite.
DATE SPEAKER and SUBJECT
APRIL 4 Dr. Alex Pentland, SRI and CSLI (Pentland@sri-ai)
Representation and Recognition of Natural Forms
APRIL 11 Prof. Terry Winograd, Stanford CSD and Linguistics (TW@sail)
Computers and Natural Language: Prospects and Problems
APRIL 18 Dr. Barbara Grosz, SRI and CSLI (Grosz@sri-ai)
The Structure of Discourse
APRIL 25 Dr. Richard Fikes, Intellicorp (Fikes@usc-ecl)
Frame-Based Representations
MAY 2 Prof. John McCarthy, Stanford CSD (JMC@sail)
Commonsense Knowledge and Reasoning in Logic
MAY 9 Prof. E. H. Shortliffe, Stanford Med. School (Shortliffe@sumex)
Oncocin: An Expert System to Help Physicians
with Cancer Treatment Decisions
MAY 16 Dr. Stan Rosenschein, SRI (Stan@sri-ai)
Mobile Robot Research at SRI
MAY 23 Dr. Richard Gabriel, Stanford and Lucid (RPG@sail)
Qlambda
MAY 30 To Be Announced
JUNE 6 Prof. Gio Wiederhold, Stanford CSD and Med School (Wiederhold@s Knowledge Representation in Rx
-----------
-------
∂20-Mar-85 1622 RA talk
Prof. Royden from Mathematics 7-2228 called. Would like you to speak
for sigma I.
∂20-Mar-85 1627 POSER@SU-CSLI.ARPA jfodor.doc
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 16:27:15 PST
Date: Wed 20 Mar 85 16:23:48-PST
From: Bill Poser <POSER@SU-CSLI.ARPA>
Subject: jfodor.doc
To: research@SU-CSLI.ARPA
A formatted version of Jerry Fodor's message may be found in <poser>jfodor.doc.
-------
∂20-Mar-85 2240 cheriton@Pescadero Re: Results of name contest
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 20 Mar 85 22:40:02 PST
Date: Wed, 20 Mar 85 22:39:33 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: Results of name contest
To: JJW@Sail, csdfacilities@SU-PESCADERO.ARPA
Cc: Nilsson@SU-Score
I must admit I like Sushi much better than Pacific. Pacifica is a great
name, too bad it is taken.
∂21-Mar-85 0817 berglund@Pescadero Max Hailperin
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 08:17:24 PST
Date: Thu, 21 Mar 85 08:17:16 pst
From: Eric Berglund <berglund@Pescadero>
Subject: Max Hailperin
To: feigenbaum@sumex-aim, jmc@sail, winograd@score
Is one of our top PhD admittees for next year. He's from MIT trying to
decide whether to stay there or come here. He'll be visiting here on
April 18 and 19, and would like to speak to you while he's here if that
can be arranged. He says his interests in AI aren't totally focussed
but that among other things he'd like to investigate the "Advanced
Architecture" project of HPP, and CSLI. Would you have time to talk
to him sometime on one of those days?
--Eric
(P.S. I'm the student on the recruitment committee in charge of exciting
him about coming here.)
∂21-Mar-85 0950 JDLH@SU-SCORE.ARPA Re: Results of name contest
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 09:50:39 PST
Received: from SU-SCORE.ARPA by Pescadero with TCP; Thu, 21 Mar 85 09:50:29 pst
Mail-From: JDLH created at 21-Mar-85 09:45:17
Date: Thu 21 Mar 85 09:45:17-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: Re: Results of name contest
To: cheriton@SU-PESCADERO.ARPA
Cc: JDLH@SU-SCORE.ARPA
In-Reply-To: Message from "David Cheriton <cheriton@Pescadero>" of Wed 20 Mar 85 22:40:22-PST
Resent-Date: Thu 21 Mar 85 09:47:11-PST
Resent-From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Resent-To: csdfacilities@SU-PESCADERO.ARPA, Nilsson@SU-SCORE.ARPA
I vote for "Sushi". I also like "Six", now that I see that "Score" ~= "20",
but that was voted down.
Question: would this machine be "SU-Sushi", with a stutter, or "SUshi",
to confuse people the way "UCBernie" does?
--Jim DeLaHunt JDLH @ Score 497-0274 (415) 327-JDLH
-------
∂21-Mar-85 1049 STUCKY@SU-CSLI.ARPA Funds for Link
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 10:46:01 PST
Date: Thu 21 Mar 85 10:43:47-PST
From: Susan Stucky <Stucky@SU-CSLI.ARPA>
Subject: Funds for Link
To: initiators@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
(If you do not know Godehard Link, or of his work, you may wish to
ignore this message.)
Godehard Link has applied and has been accepted as a Visiting Fellow
for next year. The original arrangement was that he would provide all
his own funds. But, as you know, the cost of living is high in the
Bay area, and the high value of the dollar makes it difficult for
foreign scholars to come here at present. We estimate that he needs
from $1200 to $2000 in addition to what he has. Are any of you
willing to commit any of your left-over initiator funds to this
cause? Anything would help.
-Susan
-------
∂21-Mar-85 1152 mogul@Navajo Re: Results of name contest
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 11:52:01 PST
Received: from Navajo by Pescadero with TCP; Thu, 21 Mar 85 11:51:12 pst
Date: 21 Mar 1985 1149-PST (Thursday)
From: Jeff Mogul <mogul@Navajo>
To: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: Re: Results of name contest
Cc: csdfacilities@SU-PESCADERO.ARPA, Nilsson@SU-SCORE.ARPA
We could register "Sushi" with the NIC has simple "SUSHI", by
analogy to the way BBN hosts are registered (no hyphen between
BBN and the rest of the host name), or we chould register
it as "SU-SHI" and hold a secondary contest to decide
what "SHI" stands for (let's hope it doesn't have an unpleasant
meaning in Chinese). For example
Score Hardware Increment
Sudden Hardware Influx
Student Homework Installation
etc.
-Jeff
∂21-Mar-85 1306 Brachman@SRI-KL.ARPA Re: Two Recommendations from the Conference Committee
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 13:06:29 PST
Date: Thu 21 Mar 85 09:31:40-PST
From: Ron Brachman <Brachman@SRI-KL>
Subject: Re: Two Recommendations from the Conference Committee
To: John.McDermott%CMU-CS-A@SRI-KL, DAVIS%MIT-OZ%MIT-MC@SRI-KL,
Fikes%USC-ECL@SRI-KL, Genesereth%SUMEX-AIM@SRI-KL,
Buchanan%SUMEX-AIM@SRI-KL, Engelmore%SUMEX-AIM@SRI-KL,
Lerman%SRI-KL@SRI-KL, JMC%SU-AI@SRI-KL, Raj.Reddy%CMU-CS-A@SRI-KL,
Rich%MIT-MC@SRI-KL, Stan%SRI-AI@SRI-KL, Shortliffe%SUMEX-AIM@SRI-KL,
Stefik%Xerox@SRI-KL, Tenenbaum@SRI-KL, PHW%MIT-MC@SRI-KL,
hart%SRI-AI@SRI-KL, AAAI-Office%SUMEX-AIM@SRI-KL, Amarel%RUTGERS@SRI-KL,
ai.woody%MCC@SRI-KL
cc: Brachman@SRI-KL
In-Reply-To: Message from "John.McDermott@CMU-CS-A.ARPA (A312JM01)" of Sat 16 Mar 85 18:27:00-PST
Now that we've had some discussion on the two-conference proposal, I
would like to speak out strongly in favor of the proposal as we
originally put it. While I am as worried as the next person about the
somewhat dramatic shift it entails, I am seriously afraid that the
"counter-proposal" of one gigantic conference will just make things
worse. If you recall, this past year in Austin we somewhat tried to do
what Mark has suggested by overlapping Tutorials with technical
sessions, and by making half the week specialized (with parallel
sessions) and half of general interest (all plenary) (believe me, Chuck,
we tried "careful restructuring", and it's hard as hell to make it
work). I think the result was an interestingly different National
Conference, but it did not solve the growing problem we have--there were
just too many people there without serious scientific interest to make
the conference useful to scientists (and, not to make this one-way, the
non-scientists have always complained that the technical papers are "too
arcane" [Engelmore & Hayes-Roth, AI Magazine, Summer, 1983, p. 50]). I
agree with John's characterization of the three constituencies we
have, but I also feel strongly that it is almost impossible for us to
serve adequately all three interests in one conference.
The single predominant factor, as far as I can tell, is the combination
of the scientific sessions and the tradeshow/tutorial pair. As much as
I personally enjoy seeing the trade show, I would prefer it to be
married to a set of technical sessions that suit the interests of those
who would come to the conference mainly to see the trade show. I would
certainly sacrifice those things at one conference a year just so I can
get some useful conferring done. Don't forget that just about every
conference that claims to be about AI these days (and there are many)
has its own version of a trade show and tutorials. I think we ought to
do what Randy suggests, and vigorously guard the opportunity to have a
productive scientific conference. We ought to preserve at least one
conference that doesn't have a trade show or tutorials.
I want to support Randy's contention that it is not that the size of the
conference makes it more or less scientific, but that as it grows to
include interests that see the science part as "arcane", it simply
becomes less and less useful to scientists. And I agree that as hard as
we tried to preserve it at AAAI-84, both the AAAI and IJCAI conferences
vividly demonstrate that we have lost what we used to have.
I want to emphasize that our proposal by no means intends to give second
class status to the Technology Conference. We expect the papers to be
refereed with AAAI's traditional high standards, and the panels to be of
equal quality to those we have seen before. Also, don't forget, we want
to see the best papers at each conference (or at least the most relevant
ones) be re-presented at the other conference. But the bottom line is,
I think, that we are talking about two very different kinds of
conferences, and making a ten-day extravaganza just compromises
EVERYONE'S needs. Given how hard it was to organize AAAI-84, I don't
envy John's job for IJCAI-87. Despite Saul's feelings about IJCAI, I
don't think that that conference and its handling of papers of different
types is anything to write home about. I think we can do much better,
since we are NOT obligated to suit everyone in the world in just one
week. Further, I think that AAAI has produced uniformly better
technical programs than most conferences (incl. IJCAI) because of its
unique manner of judging papers (a manageable program committee that
meets one weekend and discusses papers and panels face-to-face). If we
sacrifice that for the sake of a gigantic conference, we have really
lost something significant.
There are also other factors that make the two conference proposal more
realistic. First, we will probably have a worse and worse time finding
competent program chairs if we just get bigger and more eclectic (we
have already had this problem). I have confidence that we can find a
good chair for a limited scientific conference, since the number of
submissions will be reasonable, and most importantly, the goals of the
conference and criteria for acceptance will be clear. I suspect that
the same is true for a technology-oriented conference. But very few
will want to be in the middle of a three-ring circus where EVERY
constituency is complaining that its interests aren't being well served
(it was hard enough being assailed from all sides for AAAI-84). Also,
let us not forget Claudia's point about logistics - it will just be
easier to find two sites for smaller, shorter conferences than some
hybrid site for an 8 to 10 day NCC-style conference. And the fact
remains that if everything is being held at the same place within the
same week, there will be guaranteed to be too many disinterested people
just hanging around at the scientific part.
Finally, it has not been mentioned, but the Long-range Planning
Committee, which has been looking in general into the future of AAAI,
has looked at the two-conference proposal, and seems to support it.
Perhaps Mike can fill us in on the details of their discussions.
-------
∂21-Mar-85 1558 JFODOR@SU-CSLI.ARPA NSF
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 15:57:46 PST
Date: Thu 21 Mar 85 15:50:50-PST
From: JERRY FODOR <JFODOR@SU-CSLI.ARPA>
Subject: NSF
To: research@SU-CSLI.ARPA
Mitch:
On the off-chance that you have nothing better to do (a situation that
is hard to imagine), and on the still off-er chance that the computer
main will find yo (a possibility that is radically counter-inductive),
I'm sending along a rough draft of what I propose to do the to NSF in
the Washington meetings. Forewarned is forearmed, as I always say. (Or
is what I always say 'Don't take any wooden nickles'? I forget).
Text follows:
@Center(@B[A PRESENTATION TO THE NATIONAL SCIENCE FOUNDATION
WORKSHOP ON REPRESENTATION AND COGNITION]
Jerry A. Fodor
M.I.T.)
Like the previous speaker, John Perry, I am a philosopher by
training and occasionally, by inclination. Philosophers, as
many of you may know, are sensitive plants. We are prey to a
variety of worries that appear to be specific to our profession.
Some of us fear, for example, that there is something fundamentally
unsound about tables and chairs; that perhaps we shall run out of
prime numbers or afterimages; that our bodies aren't really there
or that our minds aren't; stuff like that. I am aware that, to
our colleagues and our spouses, these anxieties often seem
extravagant. But when they're added to the usual concerns about
getting tenure, I can assure you that they constitute a heavy load to
bear.
The reason I am bothering you with these markedly
uninterdisciplinary reflections is this. Every now and then some
merely philosophical worry turns out to be real and pressing. It
thereby ceases to be @i(merely) philosophical and presents
itself as a matter of general concern. I think that this is now
happening at the core of cognitive science and that it has
implications for the organization and administration of cognitive
science research. Moreover, I sense a rather widespread -if
implicit- consensus that something of this sort is true. I
propose, in the next less than half an hour, to try to make this
consensus more articulate.
About two hundred years ago, philosophers began to be depressed
by the following thought: that problems about the cognitive mind
and problems about symbolic representation would have to be solved
@i(together). This thought is depressing because problems about
mind and problems about representation are both very hard, and
when you've got one very hard problem to solve the last thing you
need is another one. In fact, it's so depressing that the fear
of having to face it has made behaviorists out of generations of
philosophers. And, of course, psychologists.
Depressing or otherwise, however, it's extremely plausible that the
relation between cognition and representation is intrinsic. There
are lots of ways of making this point, here's one: What
philosophers call 'intensionality' -the property, to put it
briefly, of @i(aboutness)- bifurcates the world. There are, as
far as we know, two @i(and only two) sorts of things in the whole
universe that have it, these being @i(mental states) and
@i(symbols). So, suppose, for example, that Jon -Jon Barwise, as
it might be- believes that Turing is up again. (Turing is a
disaster prone DEC 20 that lives, and sometimes works, at
Stanford). Then Jon's belief has a certain propositional content;
viz. it has the content @i(that Turing is up again). In virtue of
having that content, Jon's belief is about something (viz. it's
about Turing's current condition). And in virtue of being about
Turing's condition, Jon's belief is semantically evaluable; viz.
Jon's belief is true on the off-chance that Turing is working,
and false otherwise.
Much the same sort of thing, however can be said about
@i(symbols) -forms of words, as it might be. Consider, in
particular, the English form of words "Turing is up again!" It
looks as though that sentence -or perhaps that sentence as
employed in certain contexts- has a propositional content (it
expresses the proposition that Turing is up again); and it's
about something in virtue of having the content that it does;
and it's true or false depending on how things are with what it's
about; viz on how things are with Turing.
Notoriously, it's hard to say all this just right; that, in fact,
is one of the things that philosophers worry about. But the way
I've just said it should be good enough to make the point that
I'm urging. Nothing @i(remotely like) this story about mental
states and symbols applies to any of the rest of the created
universe. There's nothing that trees, or prime numbers, or
protons, or tables and chairs, or spouses are about; they have no
propositional content; and they are not @i(semantically)
evaluable, however useful they may be in other respects. Well,
it's hard to believe that this is all just accidental. And if
it's not, it's hard to see how whatever theory works for symbols
could fail to connect pretty closely with whatever theory works
for mind. It looks as though the mental and the symbolic form a
@i(natural theoretical domain) and are both going to have to
shelter under much the same umbrella.
So much for a quick glance at why it might seem @i(plausible)
that we need a single theory for cognition and representation;
now for a glance at why it might seem sad.
If you look at early attempts to construct the required covering
theory, the situation doesn't seem so bad. Take somebody
like Hume, for example. Here's Hume's story about how you connect
the theory of cognition with the theory of representation: Minds,
he says, are populated by a class of particulars called
'Ideas'. Ideas come in roughly three kinds: sensations,
perceptions and thoughts. (I'm not actually being faithful to
Hume's terminology, which tends to be imperspicuous.) Now, seen
from the psychologist's point of view, the interesting fact about
Ideas is that they enter into relations of association.
Association is a causal relation in virtue of which one Idea
conjures up another; Hume describes it as the mental analog to
gravitational attraction. So, then, once the outside world starts
things up by presenting a sensation to the mind, association can
keep things going by calling up perceptions and thoughts to keep
the sensation company. Hume assumes that the paradigmatic
cognitive achievements -specifically, thinking and what modern
psychologists call 'perceptual integration'- are instances of
this sort of chaining, so Hume's theory of cognitive processes
reduces exhaustively to his theory of association. A fact that he
is pleased with and advertises frequently.
Seen from the semanticist's point of view, however, the
interesting thing about Ideas is that they are @i(symbols). Give
or take a little, Hume supposes that Ideas are @i(images), and
that they represent what they resemble. Notice that Hume really
does @i(need) some such semantical assumption because he has to
answer the question 'How could the associative chaining of Ideas
constitute @i(thinking)?' In particular, chains of thought are
sequences of mental states; and, as we've seen, @i(mental states
typically have intentional properties; they're about how the
world is). So, if chains of thought are chains of Ideas, then
Ideas must somehow have intentional properties too; Ideas too
must somehow manage to be about how the world is. So Hume makes
this characteristically brilliant move: according to Hume, Ideas
have intentional properties @i(because they are symbols); the
semantically evaluable thus @i(reduces to) the symbolic; the
resemblance theory of representation @i(explains) the
intentionality of cognition.
To summarize: by the end of the 18th Century, more or
less, we have the Humean synthesis in place: the connection
between the cognitive and the representational is explained by
the hypothesis that mental processes are operations defined on
mental symbols.
We now skip a couple of hundred years during which nothing of
significance transpires. And arrive at The Modern Era.
Here's what happened in The Modern Era: First, the Humean
Synthesis broke down. Second, its breakdown came to be widely
noticed. Third, the fact that the Humean Synthesis had broken
down -and that no adequate replacement was in view- began to
present an impediment to empirical research in a variety of
disciplines from, say, linguistics to computer science to AI to
cognitive psychology to neuropsychology to the philosophy of
mind. The third of these events is patently a cause for
interdisciplinary concern. It constitutes, in my view, something
of a scientific crisis but also an unparalleled research
opportunity. And it's what brings us here today.
The crisis arises because only half of the Humean Synthesis has
proved tenable. The idea that mental processes are defined on
symbols underlies all the best modern work on cognition; in the
current state of the art, it's simply irresistable. But the idea
that mental symbols are images now appears to be subject
to insuperable objections. So we are in the position of having a
representational theory of the mind without having a theory of
mental representation. This is not a stable position; something
has to be done.
I expect that much of this part of the story is familiar to most
of you; but let me try to put it in synoptic form. We are, I
think, badly in need of perspective.
There may be mental images, and it may be important that there
are some. (I'll return to this presently; it's one of a
budget of empirical issues in psychology that our inadequte
understanding of representation makes it hard for us to work on).
But, however that goes, Hume's hope that we might solve the
problem of mental representation at a stroke by identifying the
intentional with the imagistic is clearly doomed. For two
reasons. First, if you're going to identify thinking with having
causal sequences of mental symbols run through your head, then
THE VOCABULARY THAT THESE SYMBOLS MAKE AVAILABLE MUST BE RICH
ENOUGH TO EXPRESS ALL THE CONTENTS OF THOUGHTS. If, for example,
thinking that Turing isn't up is having a negative thought, and
if having a negative thought is entertaining a mental symbol that
expresses a negative proposition, then MENTAL SYMBOLS MUST BE THE
SORTS OF THINGS THAT CAN EXPRESS NEGATION. It is, however, very
hard to express negation with an image (what does a picture of
Turing's not being up look like?) Similarly with hypothetical
propositions, and quantified propositions... and so forth. Images
don't have the right logical syntax to do what Hume wanted them
to; viz. provide the format in which our thoughts are couched.
And, second, even if we did think exclusively in images, Hume's
idea that the semantics of images reduces to resemblance won't
work. A picture can perfectly well resemble -indeed, it can
resemble as closely as you like- something that it's not a
picture @i(of). In consequence, the image theory of thought
wouldn't explain the intentionality of thought @i(even if it were
true). A line of philosophers from Wittgenstein to Nelson Goodman
have made a living off this point, and I think that we had better
let them have it.
Anyhow, if a language is needed that's rich enough to couch
thoughts in -rich enough to provide the arrays of symbols over
which cognitive processes are supposed to be defined- we've now
got better candidates than images. We've got 'formal' languages
(from logic) and programming languages (from computer science).
For that matter, we've got @i(natural) languages (for that small
and eccentric band of theorists who think that we think in
English.) The thing about these sorts of symbol systems is that
they provide formal vehicles -logico-syntactical structures-
capable of expressing very fancy propositions indeed; symbolic
structures in which you get not just negative operators, but
modal ones too; to say nothing of variables together with
quanitifiers to bind them, psychological verbs with sentences
subordinated to them; tense relations of Baroque complexity; and
adjectival and adverbal modifiers piled up until the cows come
home. The closer you get to natural languages, indeed, the closer
you get to representational systems in which one can say whatever
one can think. Not surprisingly, of course; natural langauges are
@i(for) saying what one thinks.
So what is there to be depressed about? It seems that we actually
know some things that Hume did not. On the one hand, we have
systems of logico-syntactical objects asymptotically rich enough
to provide the vehicles for thought; and, on the other, we have
the computer as a model of the mechanical manipulation of these
logico-syntactical objects. We can therefore replace Hume's story
about images associatively interconnected with an updated story
about logico-syntactic forms subsumed by computational
operations. We thus have a theory of cognitive processes
recognizably in Hume's spirit, but vastly richer in the kinds of
mental lives it can describe.
Take linguistics, for example. Here is how we do linguistics: we
specify -axiomatically- a formal language (a 'level of linguisic
description', to use the technical jargon.) This formal language
includes a (typically infinite) array of well-formed formulas,
together with their intended semantic interpretations. (So, for
example, the language might consist of an infinite set of
labelled tree structures, specified in a vocabulary that
includes the symbols 'NP', 'VP'.... etc. together with salient
geometrical relations like domination, concatenation, and so
forth. The intended interpretation of this language is specified
by saying such things as that the symbol 'NP' denotes the
property of being a nounphrase, the symbol 'VP' designates the
property of being a verb phrase...etc, and that if, in a tree
structure, a node A dominates a node B, then the semantic
interpretation of this geometrical configuration is that B is a
constituent of type A. (I am putting this rather loosely, but I
take it that the idea is familiar.)
If all this goes right, it gives us a domain of logico-syntactic
objects which, under their intended interpretations, are
representations of, say, English sentences and over which we can
specify a population of mental -specifically psycholinguistic-
processes. So we can, and do, identify parsing with the
construction of such trees from input wave-forms.
Correspondingly, language learning, at the syntactic level, turns
out to be the internalization of an axiomatization of a system of
such tree structures appropriate to describe the sentences of
the language learned. Speech production is conceptualized as the
integration of such tree structures and their transformation into
acoustic wave-forms...and so forth.
So far, this doesn't sound much like a crisis. No doubt there's
disagreement on lots of details (and on lots of nondetails, for that
matter). But this sort of picture has done good work for us
recently across a whole spectrum of disciplines. Even those who
are pessimstic about how far it can ultimately be pushed don't
expect to have to give it up tomorrow.
So then what's the problem? The problem is that, when we
construct these sorts of computational theories in psychology,
linguistics and Ai, we are working with notions that we don't
really understand. And this chicken is now coming home to roost;
what we don't understand about the foundations of computation
theory is starting to get in the way of our research.
To take one case -not a small one-: It's intrinsic to this sort of
theorizing that one thinks of the objects that get manipulated by
mental processes as 'syntactical' or 'formal' and that one thinks
of the mental processes themselves as 'computational' But we
don't really know what that means (just as Hume didn't, really,
have any @i[general] account of what it is for somethng to be an
image or a process of association.) Battles about this
keep breaking into the press. For example: are the operations
that 'transducers' perform in perception supposed to count as
computations within the meaning of the act? If not, why not? If
so, what @i(wouldn't) count as computation? A lot of the
recent sniping back and forth between 'information flow
psychologists' and 'ecological Realists' of the Gibsonian
persuasion has turned on this sort of issue. It doesn't look to
be fully resolvable short of a theory of computation broad enough
to say just what the presumed analogy between minds and computers
is actually supposed to be. And yet, as many of you will
recognize, how you jump on this distiction determines your
research priorities and tactics. You approach the experimental
investigation of perception differently if you're thinking of
organisms as transducers than you do if you're thinking of
organisms as inference machines.
Or consider another, closely related point. I said that as the
languages available for use as systems of mental representation
get closer in their expressive power to natural languages, they
also get closer to being plausible as vehicles for thought. But
this has a sinister side: As formal languages get more and more
natural WE MORE AND MORE LOSE OUR GRIP ON THEIR SEMANTICS. There
is no worked out (to say nothing of workable) specification of
the 'intended interpretations' of the well-formed formulas of
English. And a lot of peole -especially around Stanford- are
worrying that the reasons that natural language is so good at
expressing thought are @i(essentially) connected with ways in
which natural languages @i(differ) from the sorts of formalisms
traditionally used in mathematics and computer science, these
latter being the only sorts of rich symbolic systems about whose
semantics we now have much of a clue. Indexicality has loomed
large, of late, in discussions on both Coasts. I know just enough
about this to be convinced that, if that's where the problem
lies, then it is a @i(VERY HARD PROBLEM).
But there's worse; it's not just that we don't know how to
specify the intended interpretations of formalisms that look rich
enough to serve as 'languages of thought'; it's also that we
don't know what it is for something to @i(be) the 'intended'
interpretation of such a formalism. This is where it really hurts
that Hume was wrong about resemblance. For whereas Hume could say
'what it is for a thought to be about a chair is for the thought
to resemble a chair', we can't say that and @i(we don't know what
to say instead). There is an intuition that thoughts are about
the world in virtue of the way that the thinker is causally
connected to the world; that -to put it about as misleading as
possible- semantics somehow reduces to robotics. But nobody knows
how this intuition is supposed to be cashed and the problems look
formidable. The discussion of these issue in the cognitive
science literature thus far is largely a disaster area, obscured
by a pervasive confusion between semantics and logical syntax,
and littered with the corpses of dead theories.
This is, to put it mildly, no joke; to see that it is no joke,
bear in mind that saying that thoughts have semantical properties
-that they are about the world- is just a way of saying that
thoughts contain 'information' about the world. The
@i(fundamental) idea of information flow psychology is that
organisms extract information from their environments; that their
mental processes elaborate this information; and that their
behavior is determined by the information that mental processing
makes available. It is precisely this processing of information
that computational psychology is supposed to explain and
artificial intelligence is supposed to simulate. @i(And we don't
know what any of this means because we don't know what
information is.)
How much of this is just philosophy? What's important about the
current crisis of theory is that its effects are now felt broadly
throughout the information sciences. I've already mentioned the
problem of imagistic thought. It's not unreasonable, given the
experimental work by Shepard, Kosslyn, Fink, Pinker and others to
suppose that some mental representation is iconic; and it's also
not unreasonable to suppose that the iconicity of some mental
representations may be important to understanding the success of
some sorts of problem solving (see Johnson-Laird; but also Lance
Rips). That's all fine, but then the trouble starts: when you get
past the resemblance theory of reference (which, I take it,
nobody now believes) what, precisely, does the claim that mental
representation is -or, for that matter, isn't- iconic amount to?
How, precisely, are the experiments supposed to bear on that
claim (and, if the present experiments don't bear, what
experiments can we do that would?) What about John Anderson's
surprising suggestion that you can't @i(even in principle) have
empirical evidence that decides this sort of question? Suppose I
want to build a machine that's smart because it manipulates (not
mental sentences but) mental models? How do I go about even
@i(thinking) about such a machine if I don't know either what a
mental sentence or a mental model is supposed to be?
Or take another case fresh from the recent empirical literature.
There's some fascinating work by Neil Cohen that's supposed to
exhibit a pathological dissociation of knowledge of skills from
knowledge of facts. So, for example, Cohen reports the following
sort of results. If you take normal subjects and train them, over
a series of sessions, on a hard task like reading backward text,
you find two partially independent learning effects; on the one
hand, the subjects get progressively better at the task, whether
their stimulus materials be new or old items; but also, there's a
differential facilitation of materials previously seen. Thus, if
you've had a number of sessions of learning to read backwards
and I give you the stimulus 'sdrawkcab', you will, of course, do
better than a subject who has had no previous training in the
task. But also, if you've seen 'sdrawdcab' on earlier trials,
you'll do better on that item than you would on matched items
that you hadn't seen before. So it looks like there are two
learning effects: one that's item specific and one that's not.
This isn't, in itself, very surprising; but what @i(is) striking
is the existence of brain damaged populations where these effects
dissociate; these subjects exhibit the normal improvement of the
skill over practice trials, but @i(not the normal effect of
previous exposure to specific items). It's as though the subject
could learn @i(how) to read backwards, but can't learn @i(that)
'backwards' spelled backwards looks like 'sdrawkcab'. These are,
interestingly enough, the same sorts of subjects who, though they
exhibit serious short term memory deficits for names, faces,
events and the like, are apparently able to perform quite
normally on learning to solve the Tower of Hanoi problem. In the
extreme case, their learning of this problem is perfectly normal,
but they have no knowledge of having learned it. With practice,
the subject achieves essentially error-free performance on the
task; but if queried, he'll tell you that he has never seen
puzzle before, that he is behaving at random, and that his
solutions are accidental.
I really @i(do) think that's fascinating; but now, unfortunately,
the argument comes to a screeching halt for want of some
foundational theory. For, how shall we understand Cohen's
discovery in computational terms? Well, one possibility -to
which, I belive, Cohen is himself attracted- is that the
pathological population can learn 'proceedural' but not
'declarative' information. Fine, but what does @i(that)
distinction come to? If you ask a computer type, he's likely to
say that it's a @i(syntactic) distinction, analogous to the
difference between imperative and declarative
@i(sentences). But it's hard to see how that could be the heart
of the matter since, clearly, you can encode what's intuitively
declarative information in syntactically imperative form.
(Indeed, if you're into production systems, you encode
@i[everything] in imperative form, leaving yourself with no
procedural/declarative distinction at all at the level of
syntax). Or, if you ask a philosopher about Cohen's data, he'll
perhaps remind you of Ryle's distinction between 'knowing how'
and 'knowing that'. But if you ask him to tell you what @i(that)
distinction comes to, I promise that he won't be able to; not, at
least, if what you're wanting is the kind of answer that can be
formalized to provides a domain for an algorithm. Which is
presumably exactly what computational psychologists @i(do) want.
I hope I've made it clear that the problem isn't just that we don't
have a good theoretical vocabulary to report our data in; it's
that the best theory of the cognitive mind going, the
representational/ computational theory, is based on a group of
notions -information, aboutness, syntax, representation,
computation, procedure, data structure, and so forth- that are
largely unarticulated. In consequence, the computational story
about the mind isn't doing for us the sort of jobs that one's
best theory is supposed to do: guiding research, rationalizing
the investigative undertaking, and making the empirical data
cohere. Cohen has, as things now stand, these lovely findings;
and he has the computer metaphor. His problem is that his
metaphor, insofar as it is @i(just) a metaphor, doesn't engage
his data. What he needs to make sense of his empirical findings
is not a metaphor but a worked out notion of computation. He's
not the only one.
As John Perry rightly remarked, it doesn't matter if one's best
science is philosophically disreputable. On the contrary, it's
often a sign of progress since developing empirical theories are
always more or less inarticulate. And, anyhow, it's amazing how
much disrepute philosophers can learn to live with. But it
@i(does) matter when your best theories fail to organize your
best research. That's a crisis; and that's what we've got.
So much for the current causes of discontent. A couple of words
on the bright side, and a couple of administrative remarks, and
I'll be done.
First I don't mean to begin to suggest that the work on
understanding intelligence -artifical and/or natural- has got to
wait upon the solution of the foundational problems about
computation and representation. Take a case from my own
interests. I care a lot these days about questions of 'mental
architecture'; questions that concern the restrictions on
information flow between cognitive systems. (This is the area in
which the so-called 'modularity thesis' operates). This research,
like most of cognitive science, is relentlessly
interdisciplinary; you can't, for example, ask how much
contextual information is available to parsing unless you have
some idea of what parsing is; hence some idea of how the recent
psycholinguistics is shaping up. But of course you @i(can) ask it
without having a general account of the nature of information.
Such an account would certainly be useful in theory, but -thank
Heaven- it's not prerequisite to practice. It is important to
realize, however, that doing one's science this way is like
living on credit cards. Comes the end of the month, somebody has
to pay the bill. Sooner or later we're going to have to say what
it is that flows when information does.
Second, though sooner or later we have to have a theory of
representation, we perhaps don't need a theory that works for
the @i(general) case. What we need, if we are to understand and
create intelligent systems, is insight into the character of
those symbolic structures -mental representations- that mediate
cognitive processes. It may be that this means a completely
general theory of representation (one that works not just minds
but also for pictures, say, and for the harbingers of Spring);
but also it may not. Unlike such broken vessels as 'semiotics'
and 'general semantics' we can afford to start out neutral on
that issue. The prospects for constructing a theory of mental
representation are, to this extent, better than the prospects for
constructing a theory of representation at large. This is one
reason why it is absolutely essential that the foundational
work should proceed in tandem with detailed empirical studies of
cognitive and linguistic processes. We come to understand the
design specifications for a theory of information as we come to
know what representational capacities intelligent informational
processing actually does demand. In my view, that is the very
most promising direction for research to take in the immediate
future.
So here's the Fodor Plan for the development of a cognitive
science. One team starts on roughly the semantic end with the
problem of understanding information, computation and
representation. The other team starts on roughly the
psychological end with the problem of understanding mental
processes and states. If all goes well, they converge on a theory
of mental representation and there is light at both ends of the
tunnel. Individual players are encouraged to change teams
frequently in order to keep alert and infrmed. I am, by the way,
entirely serious about this proposal. If I had the responsiblity
to organize the next couple of decades of research in cognitive
science, that is how I would do it.
Third and last and last of the substantive points: If it's true
that the deep questions are getting harder to avoid, it's
equally true that the chances for answering them seem to be
improving. If we still haven't bettered Hume's idea that mental
processes are intentional because they're defined on mental
symbols, at least we have a vastly larger intellectual technology
than he did to work this idea out with. We have learned a lot
about symbol systems and their uses since the Eighteenth century.
The trouble is that the available information is scattered
through a variety of traditional disciplines. Nobody knows enough
-enough linguistics, enough computer science, enough AI, enough
psychology, enough recursion theory, enough formal semantics,
enough logic and enough neuropsychology, for starters- to do the
research that now needs to be done. I think this is going to
have to be a joint undertaking; a lot of people who are used to
working alone are now going to have to learn to work together.
I close with an organizational remark, based on the last ten
years' experience in trying to get this sort of interdisciplinary
work off the ground. Conferences aren't how to do it.
Conferences help with interdisciplinary consciousness raising,
but they are not, in and of themselves, vehicles of scientific
progress. What's needed, in my view, is the construction of
standing research environments that will permit sustained
interaction between specialists with quite different academic
backgrounds; and of pedagogical environments that will permit
young scientists to acquire mixes of competences not even
contemplated until quite recently. It goes without saying that
this cuts across traditional academic affiliations and raises
serious administrative problems. For example, it implies a
funding structure for cognitive science (singular) that is less
rigidly target oriented than NSF funding in the cognitive
sciences (plural) has thus far been. Even the organization of
peer review is problematic when the object of the exercise is
precisely to create new kinds of expertise and bring it to focus
upon new kinds of problems. Where, to put it bluntly, do you find
the peers to do the reviews?
So the administrative and the scientific problems are both hard;
and, too, it's hard admitting that the problems have maybe
started to outstrip one's training. Nevertheless, it seems to me
it's time to get the revolution started. Two hundred years is too
long to be depressed. I think, in fact, that there's a lot of
interesting philosophy and science and technology for us to do
in this field; if not literally tomorrow, than anyhow quite soon.
And even if we don't get to do it, we can create the
organizational framework in which our graduate students will.
This is, insofar as we care about the advancement of the
scientific enterprise, not just our opportunity but also our
obligation.∧
-------
∂21-Mar-85 1604 JFODOR@SU-CSLI.ARPA apologies
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 16:03:54 PST
Date: Thu 21 Mar 85 16:00:22-PST
From: JERRY FODOR <JFODOR@SU-CSLI.ARPA>
Subject: apologies
To: research@SU-CSLI.ARPA
Some of you may be wondering by now why you keep getting copies of my
paper entitled (something like) 'A Presentation to NSF'... something I'm
sure you don't want or need. It's because: I keep trying to send it to
Mitch Marcus, whose computer mail address starts 'research...blah, blah'
and, whenever Turing sees 'research' at the start of an address he (or
she, or it, or whatever) POUNCES on it, woofs (or is it 'wffs') happily,
wags his tail, and sends it to all of you.
Having now figured this out, I am in a good position to avoid repetitions in
future. Which I hereby undertake to do.
Apologies,
Jerry Fodor.
-------
∂21-Mar-85 2101 WIEDERHOLD@SUMEX-AIM.ARPA Re: BBOARD
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 21:01:08 PST
Date: Thu 21 Mar 85 17:56:06-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: BBOARD
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 19 Mar 85 13:20:00-PST
I appreciate the difference. Unfortunatly I am bound to 1200 baud dial
up line since my research needs are best served by other machines.
I do not think that all users are helpful and consider the eaders when flaming.
I try hard to be concise in itms and announcements. Gio
-------
∂21-Mar-85 2312 @SRI-KL.ARPA:ENGELMORE@SUMEX-AIM.ARPA Re: Two Recommendations from the Conference Committee
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 21 Mar 85 23:12:25 PST
Received: from SUMEX-AIM.ARPA by SRI-KL.ARPA with TCP; Thu 21 Mar 85 22:59:11-PST
Date: Thu 21 Mar 85 21:58:17-PST
From: Bob Engelmore <ENGELMORE@SUMEX-AIM.ARPA>
Subject: Re: Two Recommendations from the Conference Committee
To: Brachman@SRI-KL.ARPA, John.McDermott%CMU-CS-A@SRI-KL.ARPA,
DAVIS%MIT-OZ%MIT-MC@SRI-KL.ARPA, Fikes%USC-ECL@SRI-KL.ARPA,
Genesereth%SUMEX-AIM@SRI-KL.ARPA, Buchanan%SUMEX-AIM@SRI-KL.ARPA,
Engelmore%SUMEX-AIM@SRI-KL.ARPA, Lerman%SRI-KL@SRI-KL.ARPA,
JMC%SU-AI@SRI-KL.ARPA, Raj.Reddy%CMU-CS-A@SRI-KL.ARPA,
Rich%MIT-MC@SRI-KL.ARPA, Stan%SRI-AI@SRI-KL.ARPA,
Shortliffe%SUMEX-AIM@SRI-KL.ARPA, Stefik%Xerox@SRI-KL.ARPA,
Tenenbaum@SRI-KL.ARPA, PHW%MIT-MC@SRI-KL.ARPA, hart%SRI-AI@SRI-KL.ARPA,
AAAI-Office%SUMEX-AIM@SRI-KL.ARPA, Amarel%RUTGERS@SRI-KL.ARPA,
ai.woody%MCC@SRI-KL.ARPA
In-Reply-To: Message from "Ron Brachman <Brachman@SRI-KL>" of Thu 21 Mar 85 12:57:57-PST
Home Phone: (415) 322-0627
Office Phone: (415) 327-6600
The on-line discussion of one versus two conferences is raising issues
that are fundamental to the identity and purpose of the AAAI. I would
like to publish this discussion in the Conference issue of the AI
Magazine. Any objections?
Bob
-------
∂22-Mar-85 0937 SCHAFFER@SU-SCORE.ARPA Visiting prospective student
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Mar 85 09:37:17 PST
Date: Fri 22 Mar 85 09:37:03-PST
From: Alex <SCHAFFER@SU-SCORE.ARPA>
Subject: Visiting prospective student
To: jmc@SU-AI.ARPA
Professor McCarthy,
Nakul Saraiya, a prospective PhD student from Swarthmore, will be visiting
the department next Friday (29 March), and he would like to speak with
you. Can this be arranged?
Alex Schaffer (schaffer@score)
Member of the Recruitment Committee
-------
∂22-Mar-85 1102 @SRI-KL.ARPA,@MIT-MC:RICH@MIT-OZ Two Recommendations from the Conference Committee
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 22 Mar 85 11:02:07 PST
Received: from MIT-MC by SRI-KL.ARPA with TCP; Fri 22 Mar 85 10:57:26-PST
Received: from MIT-OZ by MIT-MC via Chaosnet; 22 MAR 85 13:57:00 EST
Date: 22 Mar 1985 13:55 EST (Fri)
Message-ID: <RICH.12097103769.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: Bob Engelmore <ENGELMORE@SUMEX-AIM.ARPA>
Cc: AAAI-Office%SUMEX-AIM@SRI-KL.ARPA, ai.woody%MCC@SRI-KL.ARPA,
Amarel%RUTGERS@SRI-KL.ARPA, Brachman@SRI-KL.ARPA,
Buchanan%SUMEX-AIM@SRI-KL.ARPA, DAVIS%MIT-OZ%MIT-MC@SRI-KL.ARPA,
Engelmore%SUMEX-AIM@SRI-KL.ARPA, Fikes%USC-ECL@SRI-KL.ARPA,
Genesereth%SUMEX-AIM@SRI-KL.ARPA, hart%SRI-AI@SRI-KL.ARPA,
JMC%SU-AI@SRI-KL.ARPA, John.McDermott%CMU-CS-A@SRI-KL.ARPA,
Lerman%SRI-KL@SRI-KL.ARPA, PHW%MIT-MC@SRI-KL.ARPA,
Raj.Reddy%CMU-CS-A@SRI-KL.ARPA, Rich%MIT-MC@SRI-KL.ARPA,
Shortliffe%SUMEX-AIM@SRI-KL.ARPA, Stan%SRI-AI@SRI-KL.ARPA,
Stefik%Xerox@SRI-KL.ARPA, Tenenbaum@SRI-KL.ARPA
Subject: Two Recommendations from the Conference Committee
In-reply-to: Msg of 22 Mar 1985 00:58-EST from Bob Engelmore <ENGELMORE at SUMEX-AIM.ARPA>
The on-line discussion of one versus two conferences is raising issues
that are fundamental to the identity and purpose of the AAAI. I would
like to publish this discussion in the Conference issue of the AI
Magazine. Any objections?
Bob
I don't think publishing the literal discussion is appropriate. I think
we need to be candid and confidential among ourselves. However, I think
once a decision is made, some edited account of the deliberations is
appropriate for the magazine.
-CR
∂23-Mar-85 1138 @SRI-KL.ARPA:ENGELMORE@SUMEX-AIM.ARPA Re: Two Recommendations from the Conference Committee
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 23 Mar 85 11:38:48 PST
Received: from SUMEX-AIM.ARPA by SRI-KL.ARPA with TCP; Sat 23 Mar 85 11:36:21-PST
Date: Sat 23 Mar 85 11:35:56-PST
From: Bob Engelmore <ENGELMORE@SUMEX-AIM.ARPA>
Subject: Re: Two Recommendations from the Conference Committee
To: RICH%MIT-OZ@MIT-MC.ARPA
cc: AAAI-Office%SUMEX-AIM@SRI-KL.ARPA, ai.woody%MCC@SRI-KL.ARPA,
Amarel%RUTGERS@SRI-KL.ARPA, Brachman@SRI-KL.ARPA,
Buchanan%SUMEX-AIM@SRI-KL.ARPA, DAVIS%MIT-OZ%MIT-MC@SRI-KL.ARPA,
Engelmore%SUMEX-AIM@SRI-KL.ARPA, Fikes%USC-ECL@SRI-KL.ARPA,
Genesereth%SUMEX-AIM@SRI-KL.ARPA, hart%SRI-AI@SRI-KL.ARPA,
JMC%SU-AI@SRI-KL.ARPA, John.McDermott%CMU-CS-A@SRI-KL.ARPA,
Lerman%SRI-KL@SRI-KL.ARPA, PHW%MIT-MC@SRI-KL.ARPA,
Raj.Reddy%CMU-CS-A@SRI-KL.ARPA, Rich%MIT-MC@SRI-KL.ARPA,
Shortliffe%SUMEX-AIM@SRI-KL.ARPA, Stan%SRI-AI@SRI-KL.ARPA,
Stefik%Xerox@SRI-KL.ARPA, Tenenbaum@SRI-KL.ARPA
In-Reply-To: Message from "Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>" of Fri 22 Mar 85 13:55:00-PST
Home Phone: (415) 322-0627
Office Phone: (415) 327-6600
Chuck,
I certainly don't want to stifle a candid discussion on the conference
issue. I'll hold off as you suggested until a decision is made. Then, if
it's agreeable to all the debaters, I'll publish an account of the
deliberations, which I believe will be of great interest to the general
membership.
Bob
-------
∂23-Mar-85 1502 BSCOTT@SU-SCORE.ARPA Les Earnest Payment
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Mar 85 15:02:30 PST
Date: Sat 23 Mar 85 15:02:16-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Les Earnest Payment
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, I have tentatively agreed to pay Les for approximately 75% of one
month's salary (but as a consulting fee) for the work he has done thus far
on the research proposal, etc. Based on the agreed $67,500 annual rate, this
amounts to about $4,400. Is this o.k., with you? I hope to get him on the
payroll as of April 1.
I should emphasize that this 75% is my suggestion, not Les's, but he thinks
it is about fair for what he has done.
Betty
-------
∂25-Mar-85 1109 SCHAFFER@SU-SCORE.ARPA re: Visiting prospective student
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Mar 85 11:09:33 PST
Date: Mon 25 Mar 85 11:09:19-PST
From: Alex <SCHAFFER@SU-SCORE.ARPA>
Subject: re: Visiting prospective student
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 25 Mar 85 09:44:00-PST
11AM is fine. I apparently got the names confused in my earlier message.
The prospective student is Yatin Saraiya. Nakul Saraiya is Yatin's brother
and is in the MSAI program here (already).
Thanks,
Alex Schaffer
-------
∂25-Mar-85 1112 YOUM@SU-SIERRA.ARPA Regarding to TV interview
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 25 Mar 85 11:12:26 PST
Date: Mon 25 Mar 85 11:11:36-PST
From: Youm Huh <YOUM@SU-SIERRA.ARPA>
Subject: Regarding to TV interview
To: jmc@SU-AI.ARPA
Professor McCarthy:
I am a Ph.D. student in EE. Since I am in CSL, I got a call
to arrange the following interview with Prof. McCarthy.
Reporters from MBC, one of the major TV networks in Korea, came
to and stays all through this week in Silicon Valley to produce a special
program to report the current state of arts and the future in VLSI and
computer science, especially in artificial intelligence.
In filming the special program, particularly they would like to have
an interview with you about the artificial intelligence.
By the schedule, they prefer March 28 (Thursday). But it can be
any date this week upon your convenience. It will be highly appreciated
for your consideration on this request.
- Youm Huh (Youm@sierra)
-------
∂25-Mar-85 1014 JJW@SU-AI.ARPA Sushi
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 25 Mar 85 10:14:23 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Mon, 25 Mar 85 10:14:08 pst
Date: 25 Mar 85 1013 PST
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: Sushi
To: csdfacilities@SU-PESCADERO.ARPA, Bosack@SU-SCORE.ARPA,
Almquist@SU-SCORE.ARPA, BillW@SU-SCORE.ARPA
It looks like "Sushi" has the most support as the name for the new
DECsystem-20, so unless there is any objection, let's call it that.
Phil, can you make the appropriate host table entries?
The official name (in the NIC table) should be "SUSHI.ARPA", not
"SU-SHI.ARPA", since the days of the "SU-" prefix are numbered. It
wouldn't make much sense to have "SHI.SU.EDU" or "SHI.STANFORD.EDU"
when we convert to domain names.
Joe
∂25-Mar-85 1538 YOM Orals
I am in the process of planning my orals.
How do you feel about my oral being in
the first week of June?
Yoram
∂25-Mar-85 1625 RA copying dispute
Michael Jacobs from Morrison & Foerster called you
(following Pat Supes suggestion), re: copying dispute involving computer
software. His no. 773 6155. If he doesn't hear from you, he'll call
back tomorrow afternoon.
∂25-Mar-85 1629 RA change in my schedule
I changed my schedule from 9:00 to 5:00 to 8:30 to 4:30. Is it ok with you?
∂25-Mar-85 1828 RESTIVO@SU-SCORE.ARPA interp[1,CWR]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Mar 85 18:28:37 PST
Date: Mon 25 Mar 85 18:28:24-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: interp[1,CWR]
To: JMC@SU-AI.ARPA
[cwr] did you have a particular application in mind that requires
and extension to the code?
-------
∂25-Mar-85 1836 RESTIVO@SU-SCORE.ARPA re: interp[1,CWR]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Mar 85 18:35:22 PST
Date: Mon 25 Mar 85 18:35:08-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: re: interp[1,CWR]
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 25 Mar 85 18:30:00-PST
[cwr] your welcome. if general if you want any hacking done feel
free to ask me.
-------
∂25-Mar-85 2240 YOM Proposal
You can find an outline of the thesis in my writeup
for the ARPA proposal, and the corresponding stack
of papers I handed you.
Roughly speaking, the work deals with logical and
practical issues of reasoning about knowledge, action
and communication. It presents (mainly propositional
modal) logics of knowledge, their underlying semantics
and complexities, with accompanying optimal decision
procedures. It treats the problem of what ``all I know
is alpha'' means in the case of one knower and in the
case of many knowers. It demonstates the relevance of
implicit knowledge (introduced in this work) and common
knowledge to action and computation in a distributed
environment. These notions are incorporated into the
logical framework, including giving complete
axiomatizations and efficient deision procedures.
It goes on to show that under practical assumptions
about the communication media it, formally speaking,
is not possible to attain common knowledge in practical
distributed systems. Attainable approximations are defined
and the circumstances under which they can be regarded as
if they were common knowledge are discussed. A case study
of the cheating husbands problem, a generalization of
the cheating wives puzzle, is presented, in order to
demonstrate the close relationship between knowledge,
communication, and action in a distributed environment.
Again, more details in the ARPA draft.
Yoram
∂25-Mar-85 2350 YOM Adviser
Officially, you are my principle thesis
adviser. Most of the work was done with
Joe Halpern as the de-facto adviser.
A few weeks ago, when you signed my G81
form, I asked you whether you were
interested in being the principle adviser
or whether it would be better to have Joe.
You made a comment about it being extremely
difficult to have Joe as the principle
adviser, and became the official principle
thesis adviser.
-yom
∂26-Mar-85 0802 RA not feeling well
To: ZM, JMC
I don`t feel well and will stay home today.
See you tomorrow.
∂26-Mar-85 0941 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Reminder: John McCarthy will speak on March 27 on prioritized circumscription.
∂26-Mar-85 1101 VAL Inferior implication
I am reading Bossu and Siegel's paper, and my impression is that what they are
studying is precisely circumscription with all predicates minimized in
parallel. Am I right?
∂26-Mar-85 1138 VAL re: Inferior implication
[In reply to message rcvd 26-Mar-85 11:13-PT.]
About the two points of difference that you mentioned:
1. "Their reasoning is entirely semantic". It seems to be a defect of their
approach, at least from the purely technical point of view. They have to prove as
a special theorem that A inf. impies B∧C iff A inf. implies B and A inf. implies
C. But if they notice once and for all that their inferior implication can be
expressed by A'⊃B, where A' is a second order formula which depends only on A,
then it becomes a simple fact of propositional logic.
2. "Their inference works even when there isn't a minimal model". Is it of any
value?
There is one more point: they work with "discriminating models". But this seems to
be equivalent to extending the theory by the distinctness axioms you introduced
in the Workshop paper (the axioms that say that all functions are 1-1 and have
disjoint domains).
It would be interesting to understand how their "practical evaluator" works and
how much it gives for computing circumscription. I'll try to do it some time.
∂26-Mar-85 1139 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Mar 85 11:39:38 PST
Date: Tue 26 Mar 85 11:36:34-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Hello,
Michael Rabins, of Detroit - Michigan, called about having you serve on a
committee for the Nat'l Science Foundation. He needs to settle this before
next week so is very anxious to talk to you.
home: 313-851-5530 or office: 313-577-3843.
Kim
-------
∂26-Mar-85 1205 VAL re: Inferior implication
[In reply to message rcvd 26-Mar-85 11:56-PT.]
You're right. The trick with using A' applies only under the additional assumption
that there is a minimal model. Then A' is the result of circumscribing all
predicates in A ∧ {distinctness axioms}, according to their Proposition 10.
∂26-Mar-85 1228 VAL text for AI course
What text would you recommend for the introductory AI course I'll be teaching next
fall at San Jose State? I tried Winston's book last time, but was not quite
satisfied. The students are not very strong, but a semester of LISP is a
prerequisite.
∂26-Mar-85 1600 AAAI@SRI-AI.ARPA Reorganization of the NCAI Conference Format
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 26 Mar 85 15:59:49 PST
Date: Tue 26 Mar 85 15:38:52-PST
From: name AAAI-OFFICE <AAAI@SRI-AI.ARPA>
Subject: Reorganization of the NCAI Conference Format
To: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Davis%MIT-OZ@MIT-MC.ARPA,
Engelmore@SUMEX-AIM.ARPA, LErman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA,
Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA, Mcdermott@CMU-CS-A.ARPA,
Reddy@CMU-CS-A.ARPA, Fikes@USC-ECL.ARPA, Stan@SRI-AI.ARPA, Rich@MIT-MC.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA
cc: Stefik@XEROX.ARPA, AAAI@SRI-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Dear AAAI Councilors:
Here are some revised proposals for a national conference that attempts
to separate the science and application sessions.
Mark and Claudia
**********************************************************
It was suggested that we work out some versions that would preserve
the current five day format, but would create more opportunities for
more colleagial interactions in the conference. Five proposed formats
were developed and discussed and then later applied against a set of
criteria noted below. After that review, only two proposals remained.
Both proposals try to separate the scientific and applications parts of
the conference (assuming there are two distinct sub-populations --
basic and applied) in time and location. The proposals have some
features in common:
* There would be a separate registration for each part of the
conference, but under one unified schedule. The conference program
would also separate the science and applied sessions by providing
two different scheduling tracks.
* Time for invited talks and technical panels is limited to one day.
(We suggest using these times to emphasize the very best of our
science. By doing this without any parallel sessions on one day we
can emphasize the primarily scientific nature of the society.)
* Time is allocated for workshops in which colleagues can get together
in scheduled small groups. By encouraging more workshops, the
conference attendee has a choice to communicate with his or her
colleague in small workshop settings or to visit the exhibits,
attend the larger paper sessions or panels.
Pre-registration information kits would include materials for
proposing workshops -- including guidelines and instructions for workshop
sponsorship by the AAAI. Workshops could span more than one day. In
addition, session chairmen would be encouraged to put together
proposals for workshops. A committee would later evaluate each
application and would assign a time and location for the workshops.
In each case, the workshop would be by invitation only. There
would also be an opportunity to have "bird of a feather" sessions
during the workshop time periods for people who want to meet
informally about an important issue or technical development.
* The trade show, although limited to three days, allows attendees from
the both communities to visit the show.
* Two co-program chairs would be responsible for their respective
interest area, but would need to coordinate their efforts with each
other particularly when applying appropriate reviewing standards
for all submitted papers. In the case of the the applied research
area, the co-program chair would be responsible in developing rigorous
reviewing standards for applied R&D papers for the AI Applications
Community.
* With the combined facilities of the Franklin Plaza Hotel
(for the science sessions and workshops), the Philadelphia
Civic Center (for the exhibits and applied sessions and panels),
possibly two auditoriums at Penn (for science sessions), and
a shuttle bus service linking the different foci of activities,
either of the two proposals can be implemented in 1986.
Proposal No. 1: TIME INTERFERENCE with delayed workshops
This proposal deliberately overlaps the science and applied sessions in
time in order to keep the scientific sessions small. In addition, the
science and applied sessions will be held in two different locations
(eg. science sessions are at the hotel because the rooms are smaller and
the applied sessions at the Civic Center are near the exhibits). The
workshops are at the end of the week allowing people to leave on
Wednesday if they do not attend the workshops or tutorials.
Mon: Science Sessions, Applied Sessions
Tues: Science Sessions, Applied Sessions, Exhibits
Wed: Panels, Pres. Address, Invited Talks, Banquet, Exhibits
Thu: Science Workshops, Applied Workshops, Tutorials, Exhibits
Fri: Science Workshops, Applied Workshops, Tutorials
Proposal No. 2: TIME SEPARATION with diversions
This proposal puts the core of the science and applied activities at
opposite ends of the week. During the science sessions, "popular" panel
sessions are used to draw the merely curious away from the scientific
sessions. It has an advantage over proposal 1 in that it makes it
possible to attend both the scientific and applied sessions.
Mon: Science Sessions, Applied Workshops, Pop Panels, Tutorials
Tues: Science Sessions, Applied Workshops, Pop Panels, Tutorials,
Exhibits
Wed: Panels, Pres. Address, Invited Talks, Banquet, Exhibits
Thu: Science Workshops, Applied Sessions, Exhibits
Fri: Science Workshops, Applied Sessions
CRITERIA
A set of evaluation criteria was identified which included some
expressed concerns noted in the previous communications from the
Council members. Those criteria included the following points:
1. Science sessions must be smaller.
Yes: 1,2 No:
2. More time for collegial interactions in small groups (workshops).
Yes: 1,2 No:
3. Short stay at conference, if attendee does not attend the
workshops
Yes: 1,2 No:
4. Attendee is able to attend both science and applied sessions.
Yes: 2 No: 1
5. Tutorials scheduled before applied sessions.
Yes: 2 No: 1
6. 3 Day Exhibit program with attendance by all communities.
Yes: 1,2 No:
7. Something else to do during "arcane" science sessions.
Yes: 1,2 No:
8. Facilities scheduling that makes feasible demands of the conference
site.
Yes: 1,2 No:
EVALUATION:
We believe that criteria 1,2,3,& 4 were of most importance to the
scientific community. By those criteria, proposal #2 slightly dominates
because it makes it possible to attend both scientific and applied
sessions.
We believe that criteria 3 & 7 were of most importance to the applied
community. By those criteria the proposals seem equivalent.
For beginners and the curious we felt that criteria 5 & 7 were most
important. By those criteria proposal 2 dominates.
One weakness in Proposal 2 is the difficulty of scheduling tutorial
and science sessons rooms at the same time (both will be competiting
for the same sized space).
************************************************
Your comments on these proposals would be appreciated.
-------
∂27-Mar-85 1000 JMC*
Bill Miller for Alex.
∂27-Mar-85 1220 RTC EBOS
What is happening with regard to the editor based operating
stuff.
Ross
∂27-Mar-85 1327 RA MAD Computer
Ab Kader from MAD Computer called (56) 493 1711 re: setting up a meeting.
∂27-Mar-85 1500 JMC*
Miller for Alex
∂27-Mar-85 1511 LES
To: JMC, RTC
Thursday at 1pm is fine with me.
∂27-Mar-85 1535 RTC EBOS
To: JMC, LES
I can't make it tomorrow. Friday would be fine, up till about 3pm.
Ross
∂27-Mar-85 1602 RTC EBOS
To: JMC, LES
Friday at 1pm then is fine with me.
Ross
∂27-Mar-85 1615 LES Friday at 1pm
To: RTC, JMC
Fine.
∂27-Mar-85 2056 RPG Meeting
To: LES, JMC, CLT
As I mentioned to Les, I have a fairly dire meeting at 9am tomorrow. I will
try to break away so as to arrive at Stanford at 10:30, but the meeting is
dire enough that I may not be able to do it.
-rpg-
∂28-Mar-85 0109 GROSOF@SU-SCORE.ARPA Re: diagnosis as circumscription
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Mar 85 01:09:49 PST
Date: Thu 28 Mar 85 01:09:27-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: Re: diagnosis as circumscription
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 28 Mar 85 01:01:00-PST
Hi John,
Sorry if I gave you the impression that the document is anything more than
a rough outline note. I just thought you'd like to see what I was talking
about in a bit more organized elaborated form. I do have an example, but
I haven't gotten around to typing it up in detail. It is for the full adder
circuit discussed in Genesereth's DART paper and Ginsberg's counterfactuals
paper.
Benjamin
-------
∂28-Mar-85 0856 RA meeting today
A reminder. You have a search committee meeting today at 2:30 at Nils
conference room.
∂28-Mar-85 0936 RA Congress in Spain
A representative of the Faculty of Computer Science in the University of
Madrid called re a congress which will take place in November. They
would like to know whether you would be interested in giving a lecture
on KNOWLEDGE AND ITS ENGINEERING. If you are interested they will send you
a letter with more details. They will call back in the afternoon. In case
you are not in, what shall I tell them?
∂28-Mar-85 1357 BOSACK@SU-SCORE.ARPA Facilities Manual
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Mar 85 13:56:51 PST
Date: Thu 28 Mar 85 13:37:53-PST
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Facilities Manual
To: BillW@SU-SCORE.ARPA, ME@SU-AI.ARPA, Almquist@SU-SCORE.ARPA,
JDLH@SU-SCORE.ARPA, Mogul@SU-SCORE.ARPA
cc: JMC@SU-AI.ARPA, JJW@SU-AI.ARPA
Every now and again the idea of a facilities manual comes up. When we have
new people it takes them quite a while to figure out what we have, how
to get to it, who does what, etc.
Since we are about to add another two production systems this quarter
(Sushi and La Brea), now seems a good time to have a go at this.
We can give hardcopy to incoming students, as well as maintain the text
online.
A fuzzy outline is below. Do I hear any 'volunteers'?
Len
General
How to get accounts
Terminal problems
Emergency contacts
Per-System (LaBrea, Navajo, Sail, Score, Sushi, Network, SUNs)
Who's responsible
What should the system be used for
Hardware available
Software available
Suggestions/contributed programs
-------
∂28-Mar-85 1357 RA leaving early
It's Thursday and I am leaving early for my class. See you tomorrow.
∂28-Mar-85 1411 HART@SRI-AI.ARPA Re: Reorganization of the NCAI Conference Format
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 28 Mar 85 14:11:10 PST
Date: Thu 28 Mar 85 13:31:20-PST
From: HART@SRI-AI.ARPA
Subject: Re: Reorganization of the NCAI Conference Format
To: AAAI@SRI-AI.ARPA
cc: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Davis%MIT-OZ@MIT-MC.ARPA,
Engelmore@SUMEX-AIM.ARPA, LErman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, Mcdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA,
Fikes@USC-ECL.ARPA, Stan@SRI-AI.ARPA, Rich@MIT-MC.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA,
Stefik@XEROX.ARPA
In-Reply-To: Message from "name AAAI-OFFICE <AAAI@SRI-AI.ARPA>" of Tue 26 Mar 85 15:39:02-PST
I think you've done an excellent job at both identifying important criteria
and presenting crisp proposals that satisfy them. My own preference is for
Proposal 2, for the reasons that you name; the proposal is good enough to
merit an effort to solve whatever logistics problems stand in the way of its
implementation.
Peter
-------
∂28-Mar-85 1429 MOGUL@SU-SCORE.ARPA Re: Facilities Manual
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Mar 85 14:29:31 PST
Date: Thu 28 Mar 85 14:28:56-PST
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: Re: Facilities Manual
To: BOSACK@SU-SCORE.ARPA, BillW@SU-SCORE.ARPA, ME@SU-AI.ARPA,
Almquist@SU-SCORE.ARPA, JDLH@SU-SCORE.ARPA
cc: JMC@SU-AI.ARPA, JJW@SU-AI.ARPA
In-Reply-To: Message from "Len Bosack <BOSACK@SU-SCORE.ARPA>" of Thu 28 Mar 85 13:38:00-PST
A good idea.
Suggestion for the outline: instead of doing everything on a per-host
basis, how about first
Per-Environment
Unix
TOPS-20
WAITS
Network
Altos/IFS
Maybe LaBrea as a separate environment
Per-System
Special hardware
Who
What
-------
∂28-Mar-85 1503 VAL consistency of circumscription
I sent a message to Etherington about the result I mentioned to you yesterday
(the consistency of circumscription with variable predicates for universal
formulas), and he replied that he had proved that too.
∂28-Mar-85 1527 JM01@CMU-CS-A.ARPA Re: Reorganization of the NCAI Conference Format
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 28 Mar 85 15:27:26 PST
Date: 28 Mar 85 18:24 EST
From: John.McDermott@CMU-CS-A.ARPA (A312JM01)
To: name AAAI-OFFICE <AAAI@SRI-AI.ARPA>
Subject: Re: Reorganization of the NCAI Conference Format
CC: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Davis%MIT-OZ@MIT-MC.ARPA,
Engelmore@SUMEX-AIM.ARPA, LErman@SRI-KL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
John.McDermott@CMU-CS-A.ARPA, Raj.Reddy@CMU-CS-A.ARPA,
Fikes@USC-ECL.ARPA, Stan@SRI-AI.ARPA, Rich@MIT-MC.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA
In-Reply-To: "name AAAI-OFFICE's message of 26 Mar 85 18:38-EST"
I think that Proposal 2 is great. (I'm substantially less happy with proposal 1
because I think we should avoid doing anything to suggest (especially to
prospective authors) that what goes on in the applied sessions is not the sort
of thing that is of interest to AI scientists.) John
∂28-Mar-85 2133 CLT
∂28-Mar-85 2021 JMC
Would you like the Chagall obituary by John Russell in a file?
----------------------
yes, please
∂29-Mar-85 0743 JJW Good news
The Hertz Foundation has continued my fellowship for the 1985-86 year.
∂29-Mar-85 0941 CLT
no supper tonight
∂29-Mar-85 1222 RA
Ab Kader from MAD Computer called (56) 493 1711 re: setting up a meeting.
He called again this mornning.
∂29-Mar-85 1227 VAL Circumscription Seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
On April 3 we meet at 2:00 in MJH 301. I will define how circumscription
is determined by assigning priorities to the minimized predicates and show
how prioritized circumscription can be reduced to a sequence of parallel
circumscriptions.
Vladimir Lifschitz
∂29-Mar-85 1234 RA your daughter Susan
Please call her.
∂29-Mar-85 1325 CLT
∂29-Mar-85 1303 JMC
Susie proposes Wednesday.
ok
∂29-Mar-85 1428 mailer@diablo add jmc@su-ai to nail
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 29 Mar 85 14:28:11 PST
Date: Fri, 29 Mar 85 14:28 PST
From: mailer@diablo
To: JMC@SU-AI.ARPA
Subject: add jmc@su-ai to nail
The command line was: Is this right?
Response from diablo Mail alias handler:
Invalid command: Is
Send mail to mail-wizards for more help, or send me a help command.
∂29-Mar-85 1431 AAAI-OFFICE@SUMEX-AIM.ARPA Copyright Permission
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 29 Mar 85 14:31:03 PST
Date: Fri 29 Mar 85 14:29:46-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Copyright Permission
To: Lerman@SRI-KL.ARPA, Engelmore@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA,
JMC@SU-AI.ARPA, Bobrow@XEROX.ARPA, AI.Woody@MCC.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
About a week ago, I had a discussion with Mike Morgan of Morgan-Kaufmann
Inc. about M-K's role in granting reprint permission to other
publishers and individuals for the papers in the proceedings. Right now,
M-K has been granting permission only if the outside party contacts
and gets permission from the author(s). Since we do not hold the
copyright consent from the individual authors, it's very important
to get their permission first before granting the AAAI's permission.
He suggested that we establish a more formal permission policy which
would take into consideration the following:
* Fee per page (normal fee is $10/page)
* Who pays and who doesn't (say, everyone else except university/
college instructors using the papers as course work)
* an acknowledgement slug
Right now, M-K would love to give us back the paperwork. Or, they might
be willing to handle it for a fee (say $5/page).
I look forward to hearing your comments on this issue.
Regards,
Claudia
-------
∂29-Mar-85 1434 mailer@diablo add
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 29 Mar 85 14:34:29 PST
Date: Fri, 29 Mar 85 14:34 PST
From: mailer@diablo
To: JMC@SU-AI.ARPA
Subject: add
The command line was: add jmc@su-ai to nail
Response from diablo Mail alias handler:
You can only add yourself to that mailing list.
Send mail to mail-wizards for more help, or send me a help command.
∂29-Mar-85 1523 @SU-CSLI.ARPA:BrianSmith.pa@Xerox.ARPA Joint F1, F3, F4, C3, and Representation seminar
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Mar 85 15:23:35 PST
Received: from Xerox.ARPA by SU-CSLI.ARPA with TCP; Fri 29 Mar 85 15:18:27-PST
Received: from Semillon.ms by ArpaGateway.ms ; 29 MAR 85 15:09:06 PST
Date: 29 Mar 85 15:09 PST
From: BrianSmith.pa@XEROX.ARPA
Subject: Joint F1, F3, F4, C3, and Representation seminar
To: F1@SU-CSLI.ARPA, F3@SU-CSLI.ARPA, F4@SU-CSLI.ARPA,
mantiq@SU-CSLI.ARPA, withgott.pa@XEROX.ARPA, jfodor@SU-CSLI.ARPA,
fodor@SU-CSLI.ARPA
cc: BrianSmith.pa@XEROX.ARPA
Spring Quarter Seminar
The Role of Representation in Computation and Reasoning
Time: Tuesday 2:00 -- 4:00 (tea will be provided)
First meeting: April 9, 1985
Place: The trailer seminar room (in front of Ventura)
What role does representation play, or need to play, in active
processes? This question has arisen time and again at CSLI,
particularly in the F1, F2, F4, and C3 groups, and in the representation
group that Meg organized a few weeks ago. For the spring quarter we
plan to merge the meetings of these projects, and have a mildly
structured seminar to focus on this particular problem. We will assign
a specific person to present material and lead discussion at each
session. In order to leave room for plenty of discussion, the format
will be to start with a 45-minute presentation, followed by a short
break for tea, followed by a one-hour discussion.
Organizationally, we will start with various people presenting their
views on the role of representation in computation and reasoning,
starting with the least-committed to representational ingredients,
moving towards stronger views.
The first meeting will be on April 9. The following is a tentative list
of initial presentations:
1. Rosenschein and Pereira, on the representational
nature (if any) of situated automata
2. David Israel, presenting some pellucid examples of
non-linguistic representational systems.
3. John Perry, on the question of whether chapter 10
committed them to a representational stance.
4. Block, disecting 3 bad arguments for representationalism
Additional topics to be discussed include the representational nature of
abstract data types, maybe some mantiq stuff, and who knows yet exactly
what else.
Administratiue details: I have asked Emma to set up a mailing list
called RRR@SU-CSLI (for "the Role of Representation in Reasoning"), to
which all recipients of this note will automatically be added. You'll
get a note when that list is in place. Further notices, ideas,
discussion, etc. (of which I hope there will be lots) should be sent to
that address.
See you all on April 9.
Brian
∂29-Mar-85 1556 ullman@diablo nail list
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 29 Mar 85 15:56:18 PST
Date: Fri, 29 Mar 85 15:56:14 pst
From: Jeff Ullman <ullman@diablo>
Subject: nail list
To: jmc@sail
I finally got to see the alias file in its entirety, and you
are on as jmc-lists@sail, but jmc@sail never made it.
I'm puzzled, because there were other entries that I had
not made myself, apparently from other systems. However,
Gio also had trouble getting diablo to accept such a message,
from sumex I think.
∂29-Mar-85 1627 BARWISE@SU-CSLI.ARPA April 1
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Mar 85 16:26:45 PST
Date: Fri 29 Mar 85 16:23:44-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: April 1
To: Researchers@SU-CSLI.ARPA
All,
On Monday, John Perry takes over as Director of CSLI. So, as my last
official message as director, I want to thank all of you for the help
you have given me this past 1.75 years. I am aware, probably more
than most, of how much effort so many of you have put in, often with
little in the way of recognition. It has been appreciated.
Several people have asked if I feel odd stepping down. The answer is,
"Sure, a bit." But it feels very good leaving the center in John's
capable hands. And it feels very good to know that I will have more
time to work with all of you on research, which is what CSLI is about.
Again, Thanks.
Jon,
-------
∂29-Mar-85 1641 burgess@diablo Re: getting on nail list
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 29 Mar 85 16:40:57 PST
Date: Fri, 29 Mar 85 16:40:58 pst
From: Bill Burgess <burgess@diablo>
Subject: Re: getting on nail list
To: JMC@Sail
You were on only once, as jmc-lists@su-ai, so that was OK.
The "mailer" pseudo-user (I think Bill Nowicki wrote this) is
very finicky about adding usernames to a mailing list with
the "add username to mailing-list" text. If "username" does
not precisely match who it thinks you are (it must get your
"real" username from someplace in your message header) it will
refuse your request, thinking that you are trying to add someone
else to the list.
This must be why "jmc-lists" failed.
To delete yourself from the mailing list, you would instead
use the subject line "delete username from mailing-list".
It is likely that the same restrictions on valid username
apply.
Bill
∂30-Mar-85 0955 @SU-CSLI.ARPA:ISRAEL@SRI-AI.ARPA Re: Joint F1, F3, F4, C3, and Representation seminar
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 30 Mar 85 09:54:57 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Sat 30 Mar 85 09:52:42-PST
Date: Sat 30 Mar 85 09:52:11-PST
From: David Israel <ISRAEL@SRI-AI.ARPA>
Subject: Re: Joint F1, F3, F4, C3, and Representation seminar
To: BrianSmith.pa@XEROX.ARPA
cc: F1@SU-CSLI.ARPA, F3@SU-CSLI.ARPA, F4@SU-CSLI.ARPA, mantiq@SU-CSLI.ARPA,
withgott.pa@XEROX.ARPA, jfodor@SU-CSLI.ARPA, fodor@SU-CSLI.ARPA,
ISRAEL@SRI-AI.ARPA
In-Reply-To: Message from "BrianSmith.pa@XEROX.ARPA" of Fri 29 Mar 85 15:09:00-PST
THAT ALL SOUNDS WON'ERFUL EXCEPT FOR THE BIT ABOUT MY TALKING ABOUT
NON-LINGUISTIC MODES OF REPRESENTATION. I'LL TALK ABOUT TURING
MACHINES (SOMETHING I KNOW SOMETHING ABOUT) - THOUGH WHY ANYONE WNATS
TO KNOW MORE ABOUT TURING MACHINES IS BEYOND ME.
-------
∂30-Mar-85 1039 SHORTLIFFE@SUMEX-AIM.ARPA Re: Halcion
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 30 Mar 85 10:39:05 PST
Date: Sat 30 Mar 85 10:39:06-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Re: Halcion
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 25 Mar 85 17:43:00-PST
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
Okay, John. Will send you a prescription via ID mail.
Regards,
Ted
-------
∂30-Mar-85 1858 GROSOF@SU-SCORE.ARPA common business communication lang. precursor
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Mar 85 18:58:43 PST
Date: Sat 30 Mar 85 18:58:21-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: common business communication lang. precursor
To: jmc@SU-AI.ARPA
Hi John,
Maybe you've already read the notice, but perhaps this week's colloquium
talk might provide some ideas/leads on what to use as a base for the CBCL
enterprise from the DB/KB pt of view. ??? I'm planning to go.
Benjamin
-------
∂31-Mar-85 0017 ALTENBERG@SUMEX-AIM.ARPA re: EURISKO
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 31 Mar 85 00:17:29 PST
Date: Sun 31 Mar 85 00:17:27-PST
From: Lee Altenberg <ALTENBERG@SUMEX-AIM.ARPA>
Subject: re: EURISKO
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 30 Mar 85 19:24:00-PST
Sorry to burden the BBOARDs but I needed to find out before Monday, I did not
want to assume that all users of EURISKO were known to Doug, and the
message did not seem out of line with the content of su-bboard, and since
AILIST is moderated, I assumed that if the message were out of line, it would
not be posted.
-Lee Altenberg
-------
∂31-Mar-85 0930 CLT
no supper
∂31-Mar-85 2124 LERMAN@SRI-KL.ARPA Re: Copyright Permission
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 31 Mar 85 21:23:54 PST
Date: Sun 31 Mar 85 21:22:48-PST
From: Lee Erman <LErman@SRI-KL.ARPA>
Subject: Re: Copyright Permission
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Engelmore@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA, JMC@SU-AI.ARPA,
Bobrow@XEROX.ARPA, AI.Woody@MCC.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Fri 29 Mar 85 14:30:11-PST
Claudia,
At the pub. mtg in Austin, we decided that AAAI would, from now on,
get copyrights to all of its publications. Is that being implemented?
I don't understand about the fee. If it's to cover the costs of
processing the request, I don't understand why it's on a per-page basis, since
presumably the actual costs must be per request, no per page. I think it is
quite reasonable to charge most requesters. But we should not charge the
authors if they request copyright permission, either for themselves or
someone else.
As to who does the paperwork: We should just treat it the simplest
way you can think of. Since we should not treat this as a money-making
proposition, the only issue is reducing the burden and making it simple.
--Lee
-------